/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-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:06:19,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:06:19,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:06:19,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:06:19,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:06:19,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:06:19,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:06:19,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:06:19,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:06:19,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:06:19,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:06:19,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:06:19,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:06:19,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:06:19,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:06:19,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:06:19,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:06:19,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:06:19,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:06:19,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:06:19,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:06:19,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:06:19,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:06:19,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:06:19,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:06:19,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:06:19,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:06:19,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:06:19,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:06:19,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:06:19,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:06:19,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:06:19,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:06:19,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:06:19,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:06:19,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:06:19,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:06:19,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:06:19,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:06:19,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:06:19,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:06:19,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:06:19,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:06:19,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:06:19,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:06:19,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:06:19,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:06:19,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:06:19,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:06:19,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:06:19,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:06:19,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:06:19,581 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:06:19,581 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-28 10:06:19,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:06:19,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:06:19,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:06:19,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:06:19,779 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:06:19,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-28 10:06:19,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498cf4782/82f7d572f159440a89d50a5e39c0f523/FLAG2ce14552b [2022-04-28 10:06:20,164 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:06:20,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-28 10:06:20,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498cf4782/82f7d572f159440a89d50a5e39c0f523/FLAG2ce14552b [2022-04-28 10:06:20,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498cf4782/82f7d572f159440a89d50a5e39c0f523 [2022-04-28 10:06:20,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:06:20,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:06:20,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:06:20,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:06:20,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:06:20,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7d9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20, skipping insertion in model container [2022-04-28 10:06:20,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:06:20,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:06:20,301 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-de41.c[368,381] [2022-04-28 10:06:20,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:06:20,316 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:06:20,331 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-de41.c[368,381] [2022-04-28 10:06:20,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:06:20,347 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:06:20,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20 WrapperNode [2022-04-28 10:06:20,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:06:20,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:06:20,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:06:20,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:06:20,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:06:20,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:06:20,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:06:20,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:06:20,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (1/1) ... [2022-04-28 10:06:20,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:06:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:20,423 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-28 10:06:20,437 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-28 10:06:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:06:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:06:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:06:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:06:20,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:06:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:06:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:06:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:06:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:06:20,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:06:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:06:20,496 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:06:20,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:06:20,624 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:06:20,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:06:20,638 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 10:06:20,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:06:20 BoogieIcfgContainer [2022-04-28 10:06:20,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:06:20,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:06:20,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:06:20,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:06:20,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:06:20" (1/3) ... [2022-04-28 10:06:20,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9787f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:06:20, skipping insertion in model container [2022-04-28 10:06:20,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:06:20" (2/3) ... [2022-04-28 10:06:20,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9787f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:06:20, skipping insertion in model container [2022-04-28 10:06:20,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:06:20" (3/3) ... [2022-04-28 10:06:20,645 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-28 10:06:20,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:06:20,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:06:20,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:06:20,687 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ef25920, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15415059 [2022-04-28 10:06:20,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:06:20,694 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-28 10:06:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:06:20,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:20,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:20,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-28 10:06:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:20,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [800968805] [2022-04-28 10:06:20,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:06:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-28 10:06:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:20,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291530255] [2022-04-28 10:06:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:20,849 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-28 10:06:20,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 10:06:20,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 10:06:20,851 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-28 10:06:20,851 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-28 10:06:20,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 10:06:20,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 10:06:20,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-28 10:06:20,852 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-28 10:06:20,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:06:20,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-28 10:06:20,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:06:20,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 10:06:20,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 10:06:20,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-28 10:06:20,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 10:06:20,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 10:06:20,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 10:06:20,854 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-28 10:06:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:20,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291530255] [2022-04-28 10:06:20,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291530255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:20,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:20,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:06:20,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [800968805] [2022-04-28 10:06:20,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [800968805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:20,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:20,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:06:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38651811] [2022-04-28 10:06:20,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:20,861 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-28 10:06:20,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:20,864 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-28 10:06:20,895 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-28 10:06:20,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:06:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:06:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:06:20,912 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-28 10:06:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:20,999 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 10:06:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:06:20,999 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-28 10:06:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:21,000 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-28 10:06:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 10:06:21,005 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-28 10:06:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 10:06:21,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-28 10:06:21,067 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-28 10:06:21,072 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:06:21,072 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:06:21,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:06:21,076 INFO L413 NwaCegarLoop]: 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-28 10:06:21,077 INFO L414 NwaCegarLoop]: 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-28 10:06:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:06:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:06:21,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:21,099 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-28 10:06:21,099 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-28 10:06:21,099 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-28 10:06:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,101 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 10:06:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:06:21,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,102 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-28 10:06:21,102 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-28 10:06:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,103 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 10:06:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:06:21,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:21,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:21,104 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-28 10:06:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-28 10:06:21,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-28 10:06:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:21,106 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-28 10:06:21,106 INFO L496 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-28 10:06:21,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-28 10:06:21,124 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-28 10:06:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 10:06:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:06:21,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:21,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:21,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:06:21,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-28 10:06:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341693562] [2022-04-28 10:06:21,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:06:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-28 10:06:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:21,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618170358] [2022-04-28 10:06:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#(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-28 10:06:21,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 10:06:21,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 10:06:21,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:21,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(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-28 10:06:21,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 10:06:21,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 10:06:21,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-28 10:06:21,474 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#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~z~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-28 10:06:21,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:06:21,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {185#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:06:21,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-28 10:06:21,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-28 10:06:21,479 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-28 10:06:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618170358] [2022-04-28 10:06:21,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618170358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:21,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:21,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:06:21,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341693562] [2022-04-28 10:06:21,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341693562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:21,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:21,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:06:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636158771] [2022-04-28 10:06:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:21,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:21,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,497 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-28 10:06:21,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:06:21,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:06:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:06:21,498 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,741 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 10:06:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:06:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 10:06:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 10:06:21,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 10:06:21,778 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-28 10:06:21,781 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:06:21,782 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:06:21,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:06:21,784 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:21,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:06:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:06:21,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:21,799 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-28 10:06:21,799 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-28 10:06:21,800 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-28 10:06:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,801 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 10:06:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:06:21,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,802 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-28 10:06:21,803 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-28 10:06:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,804 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 10:06:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:06:21,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:21,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:21,807 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-28 10:06:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 10:06:21,809 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-28 10:06:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:21,809 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 10:06:21,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-28 10:06:21,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 10:06:21,834 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-28 10:06:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:06:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:06:21,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:21,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:21,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:06:21,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:21,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-28 10:06:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983826806] [2022-04-28 10:06:21,853 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:21,853 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 2 times [2022-04-28 10:06:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:21,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106320218] [2022-04-28 10:06:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#(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-28 10:06:21,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:06:21,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:06:21,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:21,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#(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-28 10:06:21,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:06:21,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:06:21,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 10:06:21,921 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-28 10:06:21,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:21,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:21,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {364#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:21,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:21,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:21,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:21,923 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-28 10:06:21,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-28 10:06:21,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-28 10:06:21,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 10:06:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106320218] [2022-04-28 10:06:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106320218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856840939] [2022-04-28 10:06:21,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:21,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:21,926 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-28 10:06:21,934 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-28 10:06:21,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:21,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:21,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:06:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:21,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:22,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-28 10:06:22,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#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); {357#true} is VALID [2022-04-28 10:06:22,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:06:22,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:06:22,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 10:06:22,244 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-28 10:06:22,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:22,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:22,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {393#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:22,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,246 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-28 10:06:22,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-28 10:06:22,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-28 10:06:22,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 10:06:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:22,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:22,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 10:06:22,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-28 10:06:22,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-28 10:06:22,326 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-28 10:06:22,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-28 10:06:22,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {433#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:22,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {437#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:22,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {437#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:22,329 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; {444#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:22,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 10:06:22,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 10:06:22,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 10:06:22,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#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); {357#true} is VALID [2022-04-28 10:06:22,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-28 10:06:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:22,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856840939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:22,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:22,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:06:22,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:22,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983826806] [2022-04-28 10:06:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983826806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:22,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:22,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:06:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437321762] [2022-04-28 10:06:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:06:22,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:22,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,345 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-28 10:06:22,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:06:22,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:06:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:06:22,346 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:22,552 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-28 10:06:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:06:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:06:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-28 10:06:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-28 10:06:22,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-28 10:06:22,600 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-28 10:06:22,601 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:06:22,601 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:06:22,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:06:22,602 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:22,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 35 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:06:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-28 10:06:22,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:22,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,617 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,617 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:22,618 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 10:06:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 10:06:22,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:22,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:22,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:06:22,619 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:06:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:22,620 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 10:06:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 10:06:22,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:22,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:22,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 10:06:22,622 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 16 [2022-04-28 10:06:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:22,622 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 10:06:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:22,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 10:06:22,652 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-28 10:06:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:06:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:06:22,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:22,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:22,673 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-28 10:06:22,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:22,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:22,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-28 10:06:22,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:22,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986134809] [2022-04-28 10:06:22,873 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:22,873 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 2 times [2022-04-28 10:06:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437524887] [2022-04-28 10:06:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:22,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:22,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(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); {669#true} is VALID [2022-04-28 10:06:22,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-28 10:06:22,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #72#return; {669#true} is VALID [2022-04-28 10:06:22,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:22,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(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); {669#true} is VALID [2022-04-28 10:06:22,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-28 10:06:22,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #72#return; {669#true} is VALID [2022-04-28 10:06:22,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret13 := main(); {669#true} is VALID [2022-04-28 10:06:22,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {674#(= main_~y~0 0)} is VALID [2022-04-28 10:06:22,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {674#(= main_~y~0 0)} is VALID [2022-04-28 10:06:22,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#(= main_~y~0 0)} ~z~0 := ~y~0; {675#(= main_~z~0 0)} is VALID [2022-04-28 10:06:22,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(= 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; {670#false} is VALID [2022-04-28 10:06:22,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#false} assume !(~z~0 % 4294967296 > 0); {670#false} is VALID [2022-04-28 10:06:22,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#false} assume !(~y~0 % 4294967296 > 0); {670#false} is VALID [2022-04-28 10:06:22,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {670#false} is VALID [2022-04-28 10:06:22,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#false} assume !(~x~0 % 4294967296 > 0); {670#false} is VALID [2022-04-28 10:06:22,937 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {670#false} is VALID [2022-04-28 10:06:22,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#false} ~cond := #in~cond; {670#false} is VALID [2022-04-28 10:06:22,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {670#false} assume 0 == ~cond; {670#false} is VALID [2022-04-28 10:06:22,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-28 10:06:22,937 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-28 10:06:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437524887] [2022-04-28 10:06:22,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437524887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:22,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:22,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:06:22,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986134809] [2022-04-28 10:06:22,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986134809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:22,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:22,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:06:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147032663] [2022-04-28 10:06:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:22,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:22,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:22,948 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-28 10:06:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:06:22,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:22,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:06:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:06:22,949 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,032 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:06:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:06:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 10:06:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 10:06:23,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 10:06:23,057 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-28 10:06:23,058 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:06:23,058 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:06:23,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:06:23,059 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:23,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:06:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:06:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:06:23,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:23,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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-28 10:06:23,070 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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-28 10:06:23,070 INFO L87 Difference]: Start difference. First operand 23 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-28 10:06:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,071 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 10:06:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:06:23,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:23,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:23,071 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 23 states. [2022-04-28 10:06:23,071 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 23 states. [2022-04-28 10:06:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,072 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 10:06:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:06:23,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:23,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:23,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:23,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:23,072 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-28 10:06:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 10:06:23,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2022-04-28 10:06:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:23,073 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 10:06:23,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-28 10:06:23,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 10:06:23,092 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-28 10:06:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:06:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:06:23,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:23,093 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:06:23,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 3 times [2022-04-28 10:06:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:23,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263245327] [2022-04-28 10:06:23,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:23,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 4 times [2022-04-28 10:06:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51295388] [2022-04-28 10:06:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:23,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#(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); {843#true} is VALID [2022-04-28 10:06:23,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 10:06:23,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-28 10:06:23,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:23,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#(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); {843#true} is VALID [2022-04-28 10:06:23,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 10:06:23,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-28 10:06:23,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-28 10:06:23,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {848#(= main_~y~0 0)} is VALID [2022-04-28 10:06:23,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:23,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:23,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:23,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {851#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:23,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,162 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-28 10:06:23,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 10:06:23,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 10:06:23,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 10:06:23,162 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-28 10:06:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:23,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51295388] [2022-04-28 10:06:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51295388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:23,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229246601] [2022-04-28 10:06:23,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:23,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:23,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:23,163 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-28 10:06:23,169 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-28 10:06:23,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:23,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:23,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:06:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:23,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:23,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-28 10:06:23,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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); {843#true} is VALID [2022-04-28 10:06:23,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 10:06:23,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-28 10:06:23,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-28 10:06:23,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {848#(= main_~y~0 0)} is VALID [2022-04-28 10:06:23,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:23,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:23,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:23,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {883#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:23,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,359 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-28 10:06:23,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 10:06:23,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 10:06:23,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 10:06:23,359 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-28 10:06:23,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:23,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 10:06:23,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 10:06:23,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 10:06:23,444 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-28 10:06:23,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-28 10:06:23,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {927#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {923#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:23,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:23,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:23,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {938#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {934#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:23,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {938#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:23,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-28 10:06:23,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-28 10:06:23,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 10:06:23,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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); {843#true} is VALID [2022-04-28 10:06:23,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-28 10:06:23,449 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-28 10:06:23,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229246601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:23,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:23,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:06:23,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263245327] [2022-04-28 10:06:23,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263245327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:23,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:23,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:06:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585135807] [2022-04-28 10:06:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:23,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,461 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-28 10:06:23,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:06:23,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:06:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:06:23,461 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,709 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-28 10:06:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:06:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:06:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:06:23,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 10:06:23,752 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-28 10:06:23,753 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:06:23,753 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:06:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:06:23,754 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:23,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:06:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-28 10:06:23,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:23,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:23,773 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:23,773 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,774 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 10:06:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 10:06:23,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:23,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:23,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:06:23,775 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 10:06:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:23,776 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 10:06:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 10:06:23,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:23,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:23,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:23,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 10:06:23,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-28 10:06:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:23,777 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 10:06:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-28 10:06:23,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 10:06:23,805 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-28 10:06:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:06:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:06:23,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:23,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:23,823 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-28 10:06:24,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:24,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-28 10:06:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:24,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93977115] [2022-04-28 10:06:24,031 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:24,031 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 2 times [2022-04-28 10:06:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097710631] [2022-04-28 10:06:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#(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); {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:24,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#(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); {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-28 10:06:24,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-28 10:06:24,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1181#true} is VALID [2022-04-28 10:06:24,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:24,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:24,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:24,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 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; {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:06:24,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:06:24,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {1187#(<= (+ (* 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; {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:06:24,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:06:24,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1182#false} is VALID [2022-04-28 10:06:24,079 INFO L272 TraceCheckUtils]: 14: Hoare triple {1182#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1182#false} is VALID [2022-04-28 10:06:24,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {1182#false} ~cond := #in~cond; {1182#false} is VALID [2022-04-28 10:06:24,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1182#false} assume 0 == ~cond; {1182#false} is VALID [2022-04-28 10:06:24,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-28 10:06:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097710631] [2022-04-28 10:06:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097710631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114367769] [2022-04-28 10:06:24,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:24,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:24,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:24,083 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-28 10:06:24,091 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-28 10:06:24,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:24,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:24,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:06:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:24,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1181#true} is VALID [2022-04-28 10:06:24,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#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); {1181#true} is VALID [2022-04-28 10:06:24,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-28 10:06:24,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-28 10:06:24,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-28 10:06:24,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:24,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:06:24,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~0)} assume !(~x~0 % 4294967296 > 0); {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:06:24,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~0)} ~z~0 := ~y~0; {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:06:24,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~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; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:24,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:24,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(= main_~n~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; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:24,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1230#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 10:06:24,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {1230#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1234#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-28 10:06:24,617 INFO L272 TraceCheckUtils]: 14: Hoare triple {1234#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:24,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:24,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1182#false} is VALID [2022-04-28 10:06:24,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-28 10:06:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:24,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:24,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-28 10:06:24,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1182#false} is VALID [2022-04-28 10:06:24,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:24,988 INFO L272 TraceCheckUtils]: 14: Hoare triple {1258#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:24,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1258#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:24,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1262#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:24,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:24,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:24,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~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; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:24,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:06:24,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:06:24,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:06:24,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:24,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-28 10:06:24,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-28 10:06:24,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-28 10:06:24,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#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); {1181#true} is VALID [2022-04-28 10:06:24,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1181#true} is VALID [2022-04-28 10:06:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:24,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114367769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:24,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:24,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-04-28 10:06:24,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:24,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93977115] [2022-04-28 10:06:24,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93977115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:24,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:24,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:06:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152087147] [2022-04-28 10:06:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:24,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:24,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:24,994 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), 4 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-28 10:06:25,006 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-28 10:06:25,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:06:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:06:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:06:25,007 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:25,144 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 10:06:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:06:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:06:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:06:25,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:06:25,175 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-28 10:06:25,176 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:06:25,176 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:06:25,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:06:25,177 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:25,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:06:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:06:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-28 10:06:25,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:25,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-28 10:06:25,211 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-28 10:06:25,211 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-28 10:06:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:25,212 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 10:06:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 10:06:25,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:25,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:25,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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 39 states. [2022-04-28 10:06:25,213 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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 39 states. [2022-04-28 10:06:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:25,214 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 10:06:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 10:06:25,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:25,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:25,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:25,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 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-28 10:06:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-28 10:06:25,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 18 [2022-04-28 10:06:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:25,215 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-28 10:06:25,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-28 10:06:25,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-28 10:06:25,264 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-28 10:06:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-28 10:06:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:06:25,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:25,265 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:25,283 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-28 10:06:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:25,476 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 5 times [2022-04-28 10:06:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771958805] [2022-04-28 10:06:25,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:25,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 6 times [2022-04-28 10:06:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:25,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350489206] [2022-04-28 10:06:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#(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); {1550#true} is VALID [2022-04-28 10:06:25,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 10:06:25,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-28 10:06:25,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:25,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#(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); {1550#true} is VALID [2022-04-28 10:06:25,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 10:06:25,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-28 10:06:25,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-28 10:06:25,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1555#(= main_~y~0 0)} is VALID [2022-04-28 10:06:25,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {1555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:25,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:25,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1559#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-28 10:06:25,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-28 10:06:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350489206] [2022-04-28 10:06:25,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350489206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645749603] [2022-04-28 10:06:25,565 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:25,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:25,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:25,566 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-28 10:06:25,567 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-28 10:06:25,593 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:06:25,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:25,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:06:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:25,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-28 10:06:25,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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); {1550#true} is VALID [2022-04-28 10:06:25,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 10:06:25,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-28 10:06:25,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-28 10:06:25,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1555#(= main_~y~0 0)} is VALID [2022-04-28 10:06:25,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {1555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:25,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:25,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1594#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {1594#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-28 10:06:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:25,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:25,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-28 10:06:25,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-28 10:06:25,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-28 10:06:25,873 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-28 10:06:25,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {1634#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-28 10:06:25,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:25,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1638#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:25,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:25,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1645#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:25,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1649#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:25,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1653#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:25,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-28 10:06:25,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-28 10:06:25,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-28 10:06:25,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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); {1550#true} is VALID [2022-04-28 10:06:25,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-28 10:06:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:25,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645749603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:25,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:25,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:06:25,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:25,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771958805] [2022-04-28 10:06:25,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771958805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:25,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:25,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:06:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999666336] [2022-04-28 10:06:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:25,885 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-28 10:06:25,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:25,885 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-28 10:06:25,897 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-28 10:06:25,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:06:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:06:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:06:25,898 INFO L87 Difference]: Start difference. First operand 37 states and 49 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-28 10:06:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:26,328 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-28 10:06:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:06:26,329 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-28 10:06:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:26,329 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-28 10:06:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 10:06:26,330 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-28 10:06:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 10:06:26,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-28 10:06:26,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:26,380 INFO L225 Difference]: With dead ends: 68 [2022-04-28 10:06:26,380 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:06:26,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:06:26,380 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:26,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:06:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-28 10:06:26,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:26,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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-28 10:06:26,426 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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-28 10:06:26,426 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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-28 10:06:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:26,428 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-04-28 10:06:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-04-28 10:06:26,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:26,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:26,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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 59 states. [2022-04-28 10:06:26,428 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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 59 states. [2022-04-28 10:06:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:26,430 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-04-28 10:06:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-04-28 10:06:26,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:26,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:26,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:26,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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-28 10:06:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-04-28 10:06:26,431 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 18 [2022-04-28 10:06:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:26,431 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-04-28 10:06:26,432 INFO L496 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-28 10:06:26,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 59 transitions. [2022-04-28 10:06:26,490 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-28 10:06:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-28 10:06:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:06:26,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:26,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:26,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:26,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:26,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-28 10:06:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:26,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138371318] [2022-04-28 10:06:26,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:26,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 2 times [2022-04-28 10:06:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:26,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563419006] [2022-04-28 10:06:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:26,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {2038#(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); {2026#true} is VALID [2022-04-28 10:06:26,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-28 10:06:26,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-28 10:06:26,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:26,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {2038#(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); {2026#true} is VALID [2022-04-28 10:06:26,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-28 10:06:26,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-28 10:06:26,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-28 10:06:26,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:26,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2032#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:06:26,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {2032#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:06:26,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:06:26,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~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; {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:06:26,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:06:26,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~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; {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:06:26,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:06:26,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:26,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:26,902 INFO L272 TraceCheckUtils]: 15: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2036#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:06:26,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {2036#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2037#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:06:26,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {2037#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2027#false} is VALID [2022-04-28 10:06:26,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-28 10:06:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563419006] [2022-04-28 10:06:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563419006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249853031] [2022-04-28 10:06:26,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:26,904 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-28 10:06:26,905 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-28 10:06:26,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:26,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:26,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:06:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:26,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:27,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-28 10:06:27,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#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); {2026#true} is VALID [2022-04-28 10:06:27,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-28 10:06:27,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-28 10:06:27,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-28 10:06:27,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:27,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2060#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:06:27,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {2060#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2064#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:06:27,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {2064#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {2068#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:06:27,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {2068#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~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; {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 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; {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:06:27,323 INFO L272 TraceCheckUtils]: 15: Hoare triple {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:27,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:27,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {2097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-28 10:06:27,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-28 10:06:27,324 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-28 10:06:27,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:27,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-28 10:06:27,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {2097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-28 10:06:27,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:27,766 INFO L272 TraceCheckUtils]: 15: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:27,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:27,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:27,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:27,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:27,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:27,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:27,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {2132#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:27,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {2140#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {2136#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:06:27,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {2144#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2140#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:06:27,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2144#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:06:27,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-28 10:06:27,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-28 10:06:27,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-28 10:06:27,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#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); {2026#true} is VALID [2022-04-28 10:06:27,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-28 10:06:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249853031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:27,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2022-04-28 10:06:27,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138371318] [2022-04-28 10:06:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138371318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:27,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:27,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:06:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252670150] [2022-04-28 10:06:27,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:27,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:27,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:27,797 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-28 10:06:27,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:06:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:27,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:06:27,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:06:27,798 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,320 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 10:06:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:06:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 10:06:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 10:06:28,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-28 10:06:28,358 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-28 10:06:28,359 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:06:28,359 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:06:28,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:06:28,360 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:28,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:06:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-28 10:06:28,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:28,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-28 10:06:28,430 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-28 10:06:28,430 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-28 10:06:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,431 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-28 10:06:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-04-28 10:06:28,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:28,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:28,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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 52 states. [2022-04-28 10:06:28,432 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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 52 states. [2022-04-28 10:06:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,433 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-28 10:06:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-04-28 10:06:28,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:28,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:28,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:28,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-28 10:06:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-28 10:06:28,434 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 19 [2022-04-28 10:06:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:28,434 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-28 10:06:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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-28 10:06:28,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 66 transitions. [2022-04-28 10:06:28,507 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-28 10:06:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-28 10:06:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:06:28,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:28,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:28,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:06:28,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:28,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 3 times [2022-04-28 10:06:28,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:28,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539710637] [2022-04-28 10:06:28,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:28,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 4 times [2022-04-28 10:06:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372757990] [2022-04-28 10:06:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:28,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {2504#(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); {2495#true} is VALID [2022-04-28 10:06:28,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-28 10:06:28,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-28 10:06:28,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:28,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2504#(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); {2495#true} is VALID [2022-04-28 10:06:28,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-28 10:06:28,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-28 10:06:28,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-28 10:06:28,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2500#(= main_~y~0 0)} is VALID [2022-04-28 10:06:28,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {2500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2502#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:28,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2502#(and (<= main_~z~0 1) (<= 1 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; {2503#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {2503#(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; {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2496#false} assume !(~z~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {2496#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; {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2496#false} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-28 10:06:28,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-28 10:06:28,773 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-28 10:06:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372757990] [2022-04-28 10:06:28,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372757990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527764607] [2022-04-28 10:06:28,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:28,775 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-28 10:06:28,775 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-28 10:06:28,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:28,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:28,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:06:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:28,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:28,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-28 10:06:28,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#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); {2495#true} is VALID [2022-04-28 10:06:28,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-28 10:06:28,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-28 10:06:28,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-28 10:06:28,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2500#(= main_~y~0 0)} is VALID [2022-04-28 10:06:28,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {2500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2532#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {2532#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~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; {2536#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {2536#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~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; {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {2496#false} assume !(~z~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {2496#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; {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {2496#false} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-28 10:06:28,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-28 10:06:28,887 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-28 10:06:28,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:28,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-28 10:06:28,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-28 10:06:28,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-28 10:06:28,986 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-28 10:06:28,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {2579#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-28 10:06:28,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {2583#(< 0 (mod (+ main_~y~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; {2579#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:28,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:28,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {2590#(or (< 0 (mod (+ main_~y~0 4294967295) 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; {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:28,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2594#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {2590#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {2495#true} ~z~0 := ~y~0; {2594#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {2495#true} assume !(~x~0 % 4294967296 > 0); {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {2495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#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); {2495#true} is VALID [2022-04-28 10:06:28,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-28 10:06:28,993 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-28 10:06:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527764607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:28,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:28,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 10:06:28,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:28,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539710637] [2022-04-28 10:06:28,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539710637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:28,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:28,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:06:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178866696] [2022-04-28 10:06:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:06:28,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:28,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,010 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-28 10:06:29,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:06:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:06:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:06:29,011 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,285 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-28 10:06:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:06:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:06:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-28 10:06:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-28 10:06:29,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2022-04-28 10:06:29,316 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-28 10:06:29,316 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:06:29,316 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:06:29,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:06:29,317 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:29,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:06:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-28 10:06:29,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:29,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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-28 10:06:29,393 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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-28 10:06:29,394 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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-28 10:06:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,395 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-28 10:06:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-28 10:06:29,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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 49 states. [2022-04-28 10:06:29,395 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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 49 states. [2022-04-28 10:06:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,396 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-28 10:06:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-28 10:06:29,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:29,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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-28 10:06:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-04-28 10:06:29,403 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 19 [2022-04-28 10:06:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:29,403 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-04-28 10:06:29,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 59 transitions. [2022-04-28 10:06:29,469 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-28 10:06:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-28 10:06:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:06:29,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:29,471 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:29,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:29,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:29,672 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 7 times [2022-04-28 10:06:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:29,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774521285] [2022-04-28 10:06:29,675 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:29,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 8 times [2022-04-28 10:06:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:29,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669657495] [2022-04-28 10:06:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:29,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:29,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {2957#(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); {2946#true} is VALID [2022-04-28 10:06:29,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-28 10:06:29,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-28 10:06:29,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:29,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2957#(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); {2946#true} is VALID [2022-04-28 10:06:29,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-28 10:06:29,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-28 10:06:29,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-28 10:06:29,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2951#(= main_~y~0 0)} is VALID [2022-04-28 10:06:29,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:29,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:29,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:29,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:29,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2956#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {2956#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-28 10:06:29,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-28 10:06:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:29,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:29,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669657495] [2022-04-28 10:06:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669657495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:29,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023606369] [2022-04-28 10:06:29,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:29,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:29,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:29,774 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-28 10:06:29,775 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-28 10:06:29,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:29,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:29,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:06:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:29,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:29,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2946#true} is VALID [2022-04-28 10:06:29,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#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); {2946#true} is VALID [2022-04-28 10:06:29,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-28 10:06:29,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-28 10:06:29,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-28 10:06:29,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2951#(= main_~y~0 0)} is VALID [2022-04-28 10:06:29,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:29,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:29,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:29,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:29,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2994#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {2994#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-28 10:06:29,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-28 10:06:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:29,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:30,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-28 10:06:30,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-28 10:06:30,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-28 10:06:30,073 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-28 10:06:30,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:30,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:30,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {3034#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-28 10:06:30,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {3038#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3034#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:30,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {3038#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:30,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:30,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {3049#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3045#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:30,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3049#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:30,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {3057#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3053#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:30,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3057#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:30,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-28 10:06:30,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-28 10:06:30,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-28 10:06:30,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#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); {2946#true} is VALID [2022-04-28 10:06:30,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2946#true} is VALID [2022-04-28 10:06:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023606369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:30,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:30,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:06:30,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:30,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774521285] [2022-04-28 10:06:30,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774521285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:06:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147255988] [2022-04-28 10:06:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:30,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,093 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-28 10:06:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:06:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:06:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:06:30,094 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:30,691 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2022-04-28 10:06:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:06:30,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-28 10:06:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-28 10:06:30,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-28 10:06:30,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:30,755 INFO L225 Difference]: With dead ends: 82 [2022-04-28 10:06:30,755 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:06:30,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:06:30,756 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:30,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:06:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-04-28 10:06:30,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:30,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:30,842 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:30,842 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:30,843 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 10:06:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-28 10:06:30,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:30,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:30,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 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 73 states. [2022-04-28 10:06:30,844 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 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 73 states. [2022-04-28 10:06:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:30,845 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-28 10:06:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-28 10:06:30,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:30,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:30,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:30,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-04-28 10:06:30,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 19 [2022-04-28 10:06:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:30,846 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-04-28 10:06:30,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-28 10:06:30,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 69 transitions. [2022-04-28 10:06:30,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-28 10:06:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:06:30,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:30,920 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:30,938 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-28 10:06:31,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:31,121 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 3 times [2022-04-28 10:06:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575658089] [2022-04-28 10:06:31,123 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:31,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 4 times [2022-04-28 10:06:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595378017] [2022-04-28 10:06:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3513#(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); {3506#true} is VALID [2022-04-28 10:06:31,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-28 10:06:31,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-28 10:06:31,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:31,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3513#(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); {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-28 10:06:31,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-28 10:06:31,173 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-28 10:06:31,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-28 10:06:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:06:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595378017] [2022-04-28 10:06:31,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595378017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018889732] [2022-04-28 10:06:31,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:31,175 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-28 10:06:31,176 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-28 10:06:31,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:31,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:31,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:06:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:31,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#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); {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-28 10:06:31,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-28 10:06:31,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-28 10:06:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:06:31,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:31,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-28 10:06:31,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-28 10:06:31,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-28 10:06:31,540 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-28 10:06:31,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-28 10:06:31,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-28 10:06:31,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= 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; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:31,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:31,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#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); {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3506#true} is VALID [2022-04-28 10:06:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:06:31,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018889732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:31,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:31,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:06:31,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575658089] [2022-04-28 10:06:31,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575658089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:31,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:31,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:06:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55006345] [2022-04-28 10:06:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:31,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:31,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,560 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-28 10:06:31,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:06:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:06:31,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:06:31,561 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:31,741 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-04-28 10:06:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:06:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:06:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:06:31,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:06:31,768 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-28 10:06:31,769 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:06:31,769 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:06:31,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:06:31,770 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:31,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:06:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:06:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 10:06:31,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:31,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:31,855 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:31,855 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:31,856 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 10:06:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:06:31,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:31,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:31,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 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 49 states. [2022-04-28 10:06:31,857 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 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 49 states. [2022-04-28 10:06:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:31,857 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 10:06:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:06:31,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:31,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:31,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:31,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-28 10:06:31,858 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 20 [2022-04-28 10:06:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:31,858 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-28 10:06:31,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-28 10:06:31,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-28 10:06:31,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 10:06:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:06:31,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:31,935 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:31,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 10:06:32,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 9 times [2022-04-28 10:06:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200336918] [2022-04-28 10:06:32,147 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:32,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 10 times [2022-04-28 10:06:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:32,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886790126] [2022-04-28 10:06:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:32,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:32,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {3969#(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); {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {3969#(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); {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-28 10:06:32,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-28 10:06:32,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3962#(= main_~y~0 0)} is VALID [2022-04-28 10:06:32,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {3962#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:32,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:32,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:32,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:32,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:32,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3968#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {3968#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-28 10:06:32,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-28 10:06:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886790126] [2022-04-28 10:06:32,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886790126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075256848] [2022-04-28 10:06:32,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:32,247 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-28 10:06:32,248 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-28 10:06:32,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:32,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:32,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:06:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:32,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:32,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3957#true} is VALID [2022-04-28 10:06:32,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#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); {3957#true} is VALID [2022-04-28 10:06:32,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-28 10:06:32,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-28 10:06:32,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-28 10:06:32,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3962#(= main_~y~0 0)} is VALID [2022-04-28 10:06:32,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {3962#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:32,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:32,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:32,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:32,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:32,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:32,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4009#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:32,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {4009#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-28 10:06:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:32,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:32,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-28 10:06:32,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-28 10:06:32,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-28 10:06:32,588 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-28 10:06:32,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {4049#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-28 10:06:32,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {4053#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4049#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:32,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {4053#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4053#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:32,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {4060#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4053#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:32,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4060#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:32,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {4068#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4064#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:32,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {4072#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4068#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:32,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {4076#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4072#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:32,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4076#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:32,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-28 10:06:32,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-28 10:06:32,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-28 10:06:32,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#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); {3957#true} is VALID [2022-04-28 10:06:32,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3957#true} is VALID [2022-04-28 10:06:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075256848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:32,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:32,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:06:32,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200336918] [2022-04-28 10:06:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200336918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:32,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:32,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:06:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881675140] [2022-04-28 10:06:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:32,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:32,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:32,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:32,604 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-28 10:06:32,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:06:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:06:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:06:32,605 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,361 INFO L93 Difference]: Finished difference Result 91 states and 132 transitions. [2022-04-28 10:06:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:06:33,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 10:06:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 10:06:33,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 10:06:33,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:33,420 INFO L225 Difference]: With dead ends: 91 [2022-04-28 10:06:33,420 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 10:06:33,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:06:33,421 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:33,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 69 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 10:06:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2022-04-28 10:06:33,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:33,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,496 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,496 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,502 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-28 10:06:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-28 10:06:33,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:33,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 10:06:33,503 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 10:06:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,504 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-28 10:06:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-28 10:06:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:33,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:33,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-04-28 10:06:33,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 20 [2022-04-28 10:06:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:33,505 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-04-28 10:06:33,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 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-28 10:06:33,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 75 transitions. [2022-04-28 10:06:33,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-28 10:06:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:06:33,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:33,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:33,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 10:06:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:33,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 5 times [2022-04-28 10:06:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:33,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768222226] [2022-04-28 10:06:33,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:33,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 6 times [2022-04-28 10:06:33,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:33,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117845720] [2022-04-28 10:06:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:33,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:33,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {4575#(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); {4565#true} is VALID [2022-04-28 10:06:33,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-28 10:06:33,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-28 10:06:33,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:33,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {4575#(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); {4565#true} is VALID [2022-04-28 10:06:33,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-28 10:06:33,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-28 10:06:33,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-28 10:06:33,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4570#(= main_~y~0 0)} is VALID [2022-04-28 10:06:33,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {4570#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:33,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:33,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:33,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4573#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:33,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {4573#(and (<= main_~z~0 2) (<= 2 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; {4574#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {4574#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {4566#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; {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#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; {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-28 10:06:33,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-28 10:06:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:06:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117845720] [2022-04-28 10:06:33,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117845720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506559261] [2022-04-28 10:06:33,877 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:33,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:33,878 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-28 10:06:33,881 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-28 10:06:33,924 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:06:33,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:33,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:06:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:33,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:34,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4565#true} is VALID [2022-04-28 10:06:34,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#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); {4565#true} is VALID [2022-04-28 10:06:34,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-28 10:06:34,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-28 10:06:34,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-28 10:06:34,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4570#(= main_~y~0 0)} is VALID [2022-04-28 10:06:34,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {4570#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:34,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:34,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:34,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4606#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:34,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {4606#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~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; {4610#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:34,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {4610#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {4566#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; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#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; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-28 10:06:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:06:34,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:34,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-28 10:06:34,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {4662#(not (< 0 (mod 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; {4566#false} is VALID [2022-04-28 10:06:34,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {4666#(not (< 0 (mod (+ main_~y~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; {4662#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:34,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {4674#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~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; {4670#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {4565#true} ~z~0 := ~y~0; {4674#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {4565#true} assume !(~x~0 % 4294967296 > 0); {4565#true} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {4565#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4565#true} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {4565#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4565#true} is VALID [2022-04-28 10:06:34,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#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); {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4565#true} is VALID [2022-04-28 10:06:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:06:34,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506559261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:34,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:34,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-28 10:06:34,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:34,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768222226] [2022-04-28 10:06:34,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768222226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:34,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:34,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:06:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053182518] [2022-04-28 10:06:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:34,114 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 21 [2022-04-28 10:06:34,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:34,114 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-28 10:06:34,126 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-28 10:06:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:06:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:06:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:06:34,127 INFO L87 Difference]: Start difference. First operand 56 states and 75 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-28 10:06:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:34,518 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-28 10:06:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:06:34,518 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 21 [2022-04-28 10:06:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:34,519 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-28 10:06:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 10:06:34,519 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-28 10:06:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 10:06:34,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 10:06:34,554 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-28 10:06:34,554 INFO L225 Difference]: With dead ends: 75 [2022-04-28 10:06:34,554 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:06:34,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:06:34,555 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:34,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:06:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-04-28 10:06:34,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:34,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:34,648 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:34,648 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:34,649 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-28 10:06:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2022-04-28 10:06:34,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:34,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:34,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 10:06:34,650 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 10:06:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:34,651 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-28 10:06:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2022-04-28 10:06:34,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:34,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:34,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:34,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-28 10:06:34,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 21 [2022-04-28 10:06:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:34,652 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-28 10:06:34,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:34,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 74 transitions. [2022-04-28 10:06:34,737 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-28 10:06:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 10:06:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:06:34,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:34,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:34,753 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-28 10:06:34,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:06:34,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 5 times [2022-04-28 10:06:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:34,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935126221] [2022-04-28 10:06:34,948 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:34,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 6 times [2022-04-28 10:06:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:34,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362081258] [2022-04-28 10:06:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {5118#(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); {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:35,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5118#(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); {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-28 10:06:35,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5109#true} is VALID [2022-04-28 10:06:35,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5114#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:35,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {5114#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:06:35,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:06:35,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:06:35,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 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; {5116#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:06:35,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {5116#(<= (+ (* (div (+ main_~x~0 1) 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; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:35,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:35,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {5117#(<= (+ 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; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:35,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {5117#(<= (+ 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; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:35,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:35,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5110#false} is VALID [2022-04-28 10:06:35,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {5110#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5110#false} is VALID [2022-04-28 10:06:35,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {5110#false} ~cond := #in~cond; {5110#false} is VALID [2022-04-28 10:06:35,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {5110#false} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 10:06:35,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 10:06:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:35,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362081258] [2022-04-28 10:06:35,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362081258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885968798] [2022-04-28 10:06:35,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:35,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:35,018 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-28 10:06:35,036 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-28 10:06:35,050 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:06:35,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:35,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:06:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:35,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-28 10:06:35,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#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); {5109#true} is VALID [2022-04-28 10:06:35,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 10:06:35,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-28 10:06:35,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-28 10:06:35,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:35,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5141#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:06:35,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {5141#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:06:35,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:06:35,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} ~z~0 := ~y~0; {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:06:35,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~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; {5141#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:06:35,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {5141#(= (+ main_~x~0 1) main_~n~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; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:35,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:35,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {5137#(= main_~n~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; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:35,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {5137#(= main_~n~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; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:06:35,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5170#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 10:06:35,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {5170#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5174#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-28 10:06:35,484 INFO L272 TraceCheckUtils]: 17: Hoare triple {5174#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:35,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:35,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {5182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 10:06:35,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 10:06:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:35,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:35,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-28 10:06:35,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {5182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-28 10:06:35,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:35,878 INFO L272 TraceCheckUtils]: 17: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:35,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {5202#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5198#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:35,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5202#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:35,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:35,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:35,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:35,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~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; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:35,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:06:35,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} ~z~0 := ~y~0; {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:06:35,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:06:35,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:06:35,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:06:35,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:35,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-28 10:06:35,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-28 10:06:35,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-28 10:06:35,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#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); {5109#true} is VALID [2022-04-28 10:06:35,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-28 10:06:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:35,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885968798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:35,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:35,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-04-28 10:06:35,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:35,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935126221] [2022-04-28 10:06:35,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935126221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:35,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:35,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:06:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963318085] [2022-04-28 10:06:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 21 [2022-04-28 10:06:35,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:35,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 10:06:35,908 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-28 10:06:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:06:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:06:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:06:35,909 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 10:06:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:36,240 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 10:06:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:06:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 21 [2022-04-28 10:06:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 10:06:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 10:06:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 10:06:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 10:06:36,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-28 10:06:36,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:36,277 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:06:36,277 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:06:36,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:06:36,278 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:36,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 33 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:06:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-28 10:06:36,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:36,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:36,409 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:36,409 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:36,410 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 10:06:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 10:06:36,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:36,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:36,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 10:06:36,410 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 10:06:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:36,411 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 10:06:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 10:06:36,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:36,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:36,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:36,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-04-28 10:06:36,412 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 21 [2022-04-28 10:06:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:36,412 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-04-28 10:06:36,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 10:06:36,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 94 transitions. [2022-04-28 10:06:36,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-28 10:06:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:06:36,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:36,543 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:36,559 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-28 10:06:36,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:06:36,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 11 times [2022-04-28 10:06:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842940162] [2022-04-28 10:06:36,762 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:36,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 12 times [2022-04-28 10:06:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:36,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368906812] [2022-04-28 10:06:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:36,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {5715#(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); {5702#true} is VALID [2022-04-28 10:06:36,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-28 10:06:36,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-28 10:06:36,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:36,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {5715#(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); {5702#true} is VALID [2022-04-28 10:06:36,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-28 10:06:36,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-28 10:06:36,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-28 10:06:36,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5707#(= main_~y~0 0)} is VALID [2022-04-28 10:06:36,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {5707#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:36,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:36,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:36,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:36,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:36,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:36,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:36,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5714#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {5714#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-28 10:06:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:36,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368906812] [2022-04-28 10:06:36,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368906812] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:36,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808164911] [2022-04-28 10:06:36,862 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:36,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:36,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:36,863 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-28 10:06:36,864 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-28 10:06:36,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:06:36,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:36,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:06:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:36,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:37,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5702#true} is VALID [2022-04-28 10:06:37,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#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); {5702#true} is VALID [2022-04-28 10:06:37,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-28 10:06:37,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-28 10:06:37,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-28 10:06:37,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5707#(= main_~y~0 0)} is VALID [2022-04-28 10:06:37,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {5707#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:37,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:37,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:37,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:37,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:37,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:37,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:37,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5758#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:37,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {5758#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-28 10:06:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:37,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:37,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-28 10:06:37,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-28 10:06:37,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-28 10:06:37,261 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-28 10:06:37,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {5798#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-28 10:06:37,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {5802#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5798#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:37,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {5802#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5802#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:37,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {5809#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5802#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:37,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {5813#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5809#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:37,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {5817#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5813#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:37,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {5821#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5817#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:37,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {5825#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5821#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:37,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5825#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:37,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5829#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:37,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-28 10:06:37,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-28 10:06:37,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-28 10:06:37,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#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); {5702#true} is VALID [2022-04-28 10:06:37,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5702#true} is VALID [2022-04-28 10:06:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808164911] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:37,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:06:37,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:37,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842940162] [2022-04-28 10:06:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842940162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:37,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:06:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139706303] [2022-04-28 10:06:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:37,268 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-28 10:06:37,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:37,268 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-28 10:06:37,280 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-28 10:06:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:06:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:06:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:06:37,280 INFO L87 Difference]: Start difference. First operand 70 states and 94 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-28 10:06:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:38,300 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2022-04-28 10:06:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:06:38,300 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-28 10:06:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:38,301 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-28 10:06:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-28 10:06:38,303 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-28 10:06:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-28 10:06:38,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 91 transitions. [2022-04-28 10:06:38,370 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-28 10:06:38,371 INFO L225 Difference]: With dead ends: 129 [2022-04-28 10:06:38,371 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 10:06:38,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:06:38,372 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:38,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 79 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 10:06:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2022-04-28 10:06:38,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:38,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:38,516 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:38,517 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:38,518 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-28 10:06:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-04-28 10:06:38,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:38,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:38,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 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 115 states. [2022-04-28 10:06:38,519 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 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 115 states. [2022-04-28 10:06:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:38,520 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-28 10:06:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-04-28 10:06:38,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:38,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:38,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:38,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2022-04-28 10:06:38,521 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 21 [2022-04-28 10:06:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:38,522 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2022-04-28 10:06:38,522 INFO L496 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-28 10:06:38,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 107 transitions. [2022-04-28 10:06:38,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2022-04-28 10:06:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:06:38,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:38,654 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:38,672 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-28 10:06:38,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 10:06:38,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 7 times [2022-04-28 10:06:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:38,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240948776] [2022-04-28 10:06:38,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:38,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 8 times [2022-04-28 10:06:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:38,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276668170] [2022-04-28 10:06:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {6523#(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); {6512#true} is VALID [2022-04-28 10:06:38,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-28 10:06:38,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-28 10:06:38,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:38,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {6523#(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); {6512#true} is VALID [2022-04-28 10:06:38,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-28 10:06:38,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-28 10:06:38,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-28 10:06:38,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-28 10:06:38,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:38,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:38,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:38,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {6520#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:38,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {6520#(and (<= main_~z~0 2) (<= 2 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; {6521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:38,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {6521#(and (<= main_~z~0 1) (<= 1 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; {6522#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {6522#(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; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {6513#false} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {6513#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; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {6513#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; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-28 10:06:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:38,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276668170] [2022-04-28 10:06:38,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276668170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602069800] [2022-04-28 10:06:38,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:38,958 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-28 10:06:38,958 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-28 10:06:38,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:38,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:38,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:06:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:39,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-28 10:06:39,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#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); {6512#true} is VALID [2022-04-28 10:06:39,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-28 10:06:39,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-28 10:06:39,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-28 10:06:39,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-28 10:06:39,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:39,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {6554#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {6554#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~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; {6558#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:39,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {6558#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= 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; {6562#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {6562#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~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; {6513#false} is VALID [2022-04-28 10:06:39,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {6513#false} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:39,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {6513#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; {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {6513#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; {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-28 10:06:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:39,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-28 10:06:39,262 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {6608#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-28 10:06:39,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {6612#(< 0 (mod (+ main_~y~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; {6608#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:39,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {6616#(< 0 (mod (+ main_~y~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; {6612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:39,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:39,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {6623#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:39,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {6627#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {6623#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {6631#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {6627#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {6512#true} ~z~0 := ~y~0; {6631#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {6512#true} assume !(~x~0 % 4294967296 > 0); {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {6512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {6512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#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); {6512#true} is VALID [2022-04-28 10:06:39,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-28 10:06:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:39,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602069800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:39,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:39,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 10:06:39,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240948776] [2022-04-28 10:06:39,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240948776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:39,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:39,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:06:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778895974] [2022-04-28 10:06:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:39,269 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 22 [2022-04-28 10:06:39,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:39,269 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-28 10:06:39,281 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-28 10:06:39,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:06:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:06:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:06:39,281 INFO L87 Difference]: Start difference. First operand 79 states and 107 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-28 10:06:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:39,776 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2022-04-28 10:06:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:06:39,777 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 22 [2022-04-28 10:06:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:39,777 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-28 10:06:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-28 10:06:39,777 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-28 10:06:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-28 10:06:39,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-28 10:06:39,811 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-28 10:06:39,812 INFO L225 Difference]: With dead ends: 97 [2022-04-28 10:06:39,812 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 10:06:39,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:06:39,813 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:39,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 10:06:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2022-04-28 10:06:39,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:39,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:39,955 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:39,955 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:39,956 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2022-04-28 10:06:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2022-04-28 10:06:39,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:39,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:39,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 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 87 states. [2022-04-28 10:06:39,957 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 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 87 states. [2022-04-28 10:06:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:39,958 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2022-04-28 10:06:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2022-04-28 10:06:39,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:39,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:39,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:39,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2022-04-28 10:06:39,959 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 22 [2022-04-28 10:06:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:39,959 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2022-04-28 10:06:39,959 INFO L496 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-28 10:06:39,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2022-04-28 10:06:40,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2022-04-28 10:06:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:06:40,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:40,105 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:40,120 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-28 10:06:40,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:06:40,305 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 13 times [2022-04-28 10:06:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258119598] [2022-04-28 10:06:40,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:40,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 14 times [2022-04-28 10:06:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:40,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364649234] [2022-04-28 10:06:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {7222#(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); {7208#true} is VALID [2022-04-28 10:06:40,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-28 10:06:40,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-28 10:06:40,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:40,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {7222#(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); {7208#true} is VALID [2022-04-28 10:06:40,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-28 10:06:40,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-28 10:06:40,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-28 10:06:40,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7213#(= main_~y~0 0)} is VALID [2022-04-28 10:06:40,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {7213#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:40,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:40,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:40,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:40,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:40,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:40,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:40,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:40,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7221#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {7221#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-28 10:06:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:40,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364649234] [2022-04-28 10:06:40,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364649234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:40,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926808010] [2022-04-28 10:06:40,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:40,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:40,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:40,442 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-28 10:06:40,442 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-28 10:06:40,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:40,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:40,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:06:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:40,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:40,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7208#true} is VALID [2022-04-28 10:06:40,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#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); {7208#true} is VALID [2022-04-28 10:06:40,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-28 10:06:40,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-28 10:06:40,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-28 10:06:40,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7213#(= main_~y~0 0)} is VALID [2022-04-28 10:06:40,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {7213#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:40,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:40,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:40,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:40,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:40,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:40,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:40,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:40,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7268#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {7268#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-28 10:06:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:40,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:40,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-28 10:06:40,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {7308#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {7312#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7308#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:40,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {7312#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:40,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:40,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {7323#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7319#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:40,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {7327#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7323#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:40,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {7331#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7327#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:40,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {7335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7331#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:40,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {7339#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:40,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {7343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7339#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:40,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:40,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-28 10:06:40,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-28 10:06:40,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-28 10:06:40,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#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); {7208#true} is VALID [2022-04-28 10:06:40,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7208#true} is VALID [2022-04-28 10:06:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926808010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:40,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:40,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:06:40,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258119598] [2022-04-28 10:06:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258119598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:40,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:40,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:06:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413120627] [2022-04-28 10:06:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:40,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:40,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:40,829 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-28 10:06:40,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:06:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:06:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:06:40,830 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,131 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2022-04-28 10:06:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:06:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-28 10:06:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-28 10:06:42,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 101 transitions. [2022-04-28 10:06:42,210 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-28 10:06:42,212 INFO L225 Difference]: With dead ends: 142 [2022-04-28 10:06:42,212 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 10:06:42,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:06:42,212 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:42,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 89 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:06:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 10:06:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2022-04-28 10:06:42,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:42,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:42,372 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:42,372 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,374 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2022-04-28 10:06:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2022-04-28 10:06:42,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:42,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:42,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 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 128 states. [2022-04-28 10:06:42,374 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 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 128 states. [2022-04-28 10:06:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,376 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2022-04-28 10:06:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2022-04-28 10:06:42,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:42,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:42,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:42,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-04-28 10:06:42,377 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 22 [2022-04-28 10:06:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:42,378 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-04-28 10:06:42,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-28 10:06:42,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 117 transitions. [2022-04-28 10:06:42,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-04-28 10:06:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:06:42,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:42,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:42,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:42,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:42,746 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 7 times [2022-04-28 10:06:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:42,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319202345] [2022-04-28 10:06:42,749 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:42,749 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 8 times [2022-04-28 10:06:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47789724] [2022-04-28 10:06:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:42,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {8110#(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); {8096#true} is VALID [2022-04-28 10:06:42,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-28 10:06:42,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-28 10:06:42,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {8110#(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); {8096#true} is VALID [2022-04-28 10:06:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-28 10:06:42,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-28 10:06:42,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-28 10:06:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:42,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8102#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:43,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {8102#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8103#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-28 10:06:43,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {8103#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:43,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:43,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~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; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:43,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~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; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:43,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:43,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~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; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:43,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~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; {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:06:43,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:06:43,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:43,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:43,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:43,013 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:06:43,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {8108#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:06:43,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {8109#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8097#false} is VALID [2022-04-28 10:06:43,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-28 10:06:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47789724] [2022-04-28 10:06:43,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47789724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:43,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711389369] [2022-04-28 10:06:43,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:43,015 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-28 10:06:43,016 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-28 10:06:43,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:43,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:43,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:06:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:43,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:44,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8096#true} is VALID [2022-04-28 10:06:44,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#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); {8096#true} is VALID [2022-04-28 10:06:44,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-28 10:06:44,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-28 10:06:44,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-28 10:06:44,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:44,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8132#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:06:44,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {8132#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8136#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:06:44,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {8136#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:44,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:44,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (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; {8147#(and (= main_~y~0 2) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:06:44,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {8147#(and (= main_~y~0 2) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~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; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:44,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:44,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~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; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:44,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~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; {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:06:44,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:06:44,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:44,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:44,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:44,115 INFO L272 TraceCheckUtils]: 19: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:44,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:44,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {8179#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8097#false} is VALID [2022-04-28 10:06:44,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-28 10:06:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:44,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:44,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-28 10:06:44,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {8179#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8097#false} is VALID [2022-04-28 10:06:44,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:44,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:44,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:44,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~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; {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:44,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {8230#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:44,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8230#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:06:44,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8234#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:06:44,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8238#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:44,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-28 10:06:44,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-28 10:06:44,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-28 10:06:44,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#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); {8096#true} is VALID [2022-04-28 10:06:44,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8096#true} is VALID [2022-04-28 10:06:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:44,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711389369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:44,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:44,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 23 [2022-04-28 10:06:44,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:44,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319202345] [2022-04-28 10:06:44,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319202345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:44,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:44,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:06:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997587457] [2022-04-28 10:06:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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 23 [2022-04-28 10:06:44,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:44,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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-28 10:06:44,615 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-28 10:06:44,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:06:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:06:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:06:44,616 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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-28 10:06:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:45,382 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-04-28 10:06:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:06:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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 23 [2022-04-28 10:06:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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-28 10:06:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-28 10:06:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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-28 10:06:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-28 10:06:45,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-28 10:06:45,427 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-28 10:06:45,428 INFO L225 Difference]: With dead ends: 98 [2022-04-28 10:06:45,428 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 10:06:45,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:06:45,429 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:45,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 10:06:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-28 10:06:45,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:45,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:45,648 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:45,648 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:45,650 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 10:06:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 10:06:45,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:45,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:45,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 10:06:45,650 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 10:06:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:45,651 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 10:06:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 10:06:45,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:45,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:45,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:45,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2022-04-28 10:06:45,653 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 23 [2022-04-28 10:06:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:45,653 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2022-04-28 10:06:45,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 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-28 10:06:45,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 121 transitions. [2022-04-28 10:06:46,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2022-04-28 10:06:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:06:46,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:46,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:46,395 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-28 10:06:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:06:46,580 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 9 times [2022-04-28 10:06:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:46,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491291481] [2022-04-28 10:06:46,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:46,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 10 times [2022-04-28 10:06:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:46,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299195116] [2022-04-28 10:06:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:46,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {8850#(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); {8839#true} is VALID [2022-04-28 10:06:46,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-28 10:06:46,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-28 10:06:46,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:46,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {8850#(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); {8839#true} is VALID [2022-04-28 10:06:46,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-28 10:06:46,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-28 10:06:46,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-28 10:06:46,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8844#(= main_~y~0 0)} is VALID [2022-04-28 10:06:46,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {8844#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:46,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:46,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:46,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:46,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8848#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {8848#(and (<= main_~z~0 3) (<= 3 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; {8849#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {8849#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-28 10:06:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:06:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:46,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299195116] [2022-04-28 10:06:46,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299195116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:46,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943710939] [2022-04-28 10:06:46,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:46,677 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-28 10:06:46,678 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-28 10:06:46,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:46,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:46,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:06:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:46,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:46,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8839#true} is VALID [2022-04-28 10:06:46,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#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); {8839#true} is VALID [2022-04-28 10:06:46,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-28 10:06:46,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-28 10:06:46,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-28 10:06:46,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8844#(= main_~y~0 0)} is VALID [2022-04-28 10:06:46,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {8844#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:46,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:46,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:46,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:46,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8884#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:46,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {8884#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {8888#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {8888#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-28 10:06:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:06:46,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-28 10:06:46,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#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; {8840#false} is VALID [2022-04-28 10:06:46,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {8946#(not (< 0 (mod 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; {8840#false} is VALID [2022-04-28 10:06:46,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8950#(not (< 0 (mod (+ main_~y~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; {8946#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:46,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {8954#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8950#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {8958#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~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; {8954#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {8839#true} ~z~0 := ~y~0; {8958#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {8839#true} assume !(~x~0 % 4294967296 > 0); {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#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); {8839#true} is VALID [2022-04-28 10:06:46,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8839#true} is VALID [2022-04-28 10:06:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:06:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943710939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:46,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:46,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:06:46,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:46,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491291481] [2022-04-28 10:06:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491291481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:46,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:46,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:06:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551485044] [2022-04-28 10:06:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:46,904 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-28 10:06:46,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:46,905 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-28 10:06:46,917 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-28 10:06:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:06:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:06:46,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:06:46,922 INFO L87 Difference]: Start difference. First operand 91 states and 121 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-28 10:06:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,565 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2022-04-28 10:06:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:06:47,565 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-28 10:06:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:47,565 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-28 10:06:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 10:06:47,566 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-28 10:06:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 10:06:47,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 10:06:47,623 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-28 10:06:47,624 INFO L225 Difference]: With dead ends: 122 [2022-04-28 10:06:47,625 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 10:06:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:06:47,625 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:47,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 10:06:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2022-04-28 10:06:47,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:47,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,826 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,826 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,827 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-04-28 10:06:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-04-28 10:06:47,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:47,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:47,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 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 111 states. [2022-04-28 10:06:47,828 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 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 111 states. [2022-04-28 10:06:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,831 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-04-28 10:06:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-04-28 10:06:47,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:47,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:47,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:47,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2022-04-28 10:06:47,834 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 23 [2022-04-28 10:06:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:47,834 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2022-04-28 10:06:47,834 INFO L496 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-28 10:06:47,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 120 transitions. [2022-04-28 10:06:48,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-28 10:06:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:06:48,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:48,120 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:48,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:48,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:48,323 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 15 times [2022-04-28 10:06:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575065524] [2022-04-28 10:06:48,326 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:48,326 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 16 times [2022-04-28 10:06:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:48,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621136964] [2022-04-28 10:06:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {9671#(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); {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:48,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {9671#(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); {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-28 10:06:48,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-28 10:06:48,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9661#(= main_~y~0 0)} is VALID [2022-04-28 10:06:48,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {9661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:48,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:48,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:48,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:48,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:48,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:48,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:48,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:48,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {9670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-28 10:06:48,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-28 10:06:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:48,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621136964] [2022-04-28 10:06:48,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621136964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:48,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246826344] [2022-04-28 10:06:48,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:48,461 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-28 10:06:48,462 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-28 10:06:48,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:48,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:48,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:06:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:48,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9656#true} is VALID [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#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); {9656#true} is VALID [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-28 10:06:48,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-28 10:06:48,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9661#(= main_~y~0 0)} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {9661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:48,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:48,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:48,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:48,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:48,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:48,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:48,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:48,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:48,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {9720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-28 10:06:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:48,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:48,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-28 10:06:48,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-28 10:06:48,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-28 10:06:48,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-28 10:06:48,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {9760#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-28 10:06:48,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {9764#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9760#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:48,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {9764#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:48,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {9771#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:48,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {9775#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:48,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {9779#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:48,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {9783#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:48,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {9787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:48,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {9791#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:48,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {9795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9791#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:48,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {9799#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:48,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9799#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:48,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-28 10:06:48,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-28 10:06:48,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-28 10:06:48,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#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); {9656#true} is VALID [2022-04-28 10:06:48,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9656#true} is VALID [2022-04-28 10:06:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246826344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:48,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:48,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:06:48,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575065524] [2022-04-28 10:06:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575065524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:48,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:48,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:06:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133242283] [2022-04-28 10:06:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:48,904 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 23 [2022-04-28 10:06:48,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:48,905 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-28 10:06:48,928 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-28 10:06:48,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:06:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:06:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:06:48,929 INFO L87 Difference]: Start difference. First operand 91 states and 120 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-28 10:06:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:50,524 INFO L93 Difference]: Finished difference Result 162 states and 236 transitions. [2022-04-28 10:06:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:06:50,525 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 23 [2022-04-28 10:06:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:50,525 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-28 10:06:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-28 10:06:50,526 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-28 10:06:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-28 10:06:50,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-04-28 10:06:50,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:50,622 INFO L225 Difference]: With dead ends: 162 [2022-04-28 10:06:50,622 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 10:06:50,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:06:50,623 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:50,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 99 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 10:06:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2022-04-28 10:06:50,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:50,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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-28 10:06:50,838 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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-28 10:06:50,838 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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-28 10:06:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:50,840 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-04-28 10:06:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-04-28 10:06:50,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:50,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:50,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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 148 states. [2022-04-28 10:06:50,840 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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 148 states. [2022-04-28 10:06:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:50,842 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-04-28 10:06:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-04-28 10:06:50,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:50,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:50,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:50,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 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-28 10:06:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2022-04-28 10:06:50,843 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 23 [2022-04-28 10:06:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:50,844 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2022-04-28 10:06:50,844 INFO L496 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-28 10:06:50,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 133 transitions. [2022-04-28 10:06:51,077 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-28 10:06:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-28 10:06:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:06:51,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:51,078 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:51,093 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-28 10:06:51,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:51,278 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 11 times [2022-04-28 10:06:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:51,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142124527] [2022-04-28 10:06:51,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:51,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 12 times [2022-04-28 10:06:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:51,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662603006] [2022-04-28 10:06:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:51,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {10668#(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); {10660#true} is VALID [2022-04-28 10:06:51,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-28 10:06:51,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:51,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {10668#(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); {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= 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; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= 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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-28 10:06:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662603006] [2022-04-28 10:06:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662603006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786851180] [2022-04-28 10:06:51,346 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:51,351 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-28 10:06:51,359 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-28 10:06:51,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:06:51,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:51,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:06:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:51,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:51,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10660#true} is VALID [2022-04-28 10:06:51,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#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); {10660#true} is VALID [2022-04-28 10:06:51,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-28 10:06:51,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-28 10:06:51,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-28 10:06:51,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-28 10:06:51,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= 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; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= 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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-28 10:06:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:51,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:51,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-28 10:06:51,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-28 10:06:51,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-28 10:06:51,759 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-28 10:06:51,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-28 10:06:51,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-28 10:06:51,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= 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; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:51,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= 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; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#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); {10660#true} is VALID [2022-04-28 10:06:51,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10660#true} is VALID [2022-04-28 10:06:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786851180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:51,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:51,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-28 10:06:51,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142124527] [2022-04-28 10:06:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142124527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:51,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:51,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:06:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045482584] [2022-04-28 10:06:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:06:51,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:51,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:51,780 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-28 10:06:51,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:06:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:51,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:06:51,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:06:51,781 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,205 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2022-04-28 10:06:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:06:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:06:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:06:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:06:52,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:06:52,237 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-28 10:06:52,238 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:06:52,238 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 10:06:52,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:06:52,239 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:52,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 10:06:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-28 10:06:52,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:52,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,420 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,421 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,422 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-28 10:06:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-28 10:06:52,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:52,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:52,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 10:06:52,423 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 10:06:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,424 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-28 10:06:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-28 10:06:52,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:52,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:52,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:52,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2022-04-28 10:06:52,425 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 24 [2022-04-28 10:06:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:52,425 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2022-04-28 10:06:52,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 123 transitions. [2022-04-28 10:06:52,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2022-04-28 10:06:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:06:52,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:52,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:52,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:52,869 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 9 times [2022-04-28 10:06:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:52,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145151671] [2022-04-28 10:06:52,872 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:52,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 10 times [2022-04-28 10:06:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:52,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097780028] [2022-04-28 10:06:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:52,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {11415#(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); {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:52,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {11415#(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); {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-28 10:06:52,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-28 10:06:52,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-28 10:06:52,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:52,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:06:52,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {11410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:06:52,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:06:52,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:06:52,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 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; {11412#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:06:52,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {11412#(<= (+ (* (div (+ main_~x~0 2) 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; {11413#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:06:52,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {11413#(<= (+ 2 (* (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; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {11414#(<= (+ 3 (* 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; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {11414#(<= (+ 3 (* 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; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {11414#(<= (+ 3 (* 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; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:06:52,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-28 10:06:52,975 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-28 10:06:52,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-28 10:06:52,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-28 10:06:52,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-28 10:06:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:52,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097780028] [2022-04-28 10:06:52,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097780028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018652674] [2022-04-28 10:06:52,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:52,977 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-28 10:06:52,985 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-28 10:06:53,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:53,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:53,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:06:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:53,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11404#true} is VALID [2022-04-28 10:06:53,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#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); {11404#true} is VALID [2022-04-28 10:06:53,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-28 10:06:53,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-28 10:06:53,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-28 10:06:53,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-28 10:06:53,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:53,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:06:53,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:06:53,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:53,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-28 10:06:53,251 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-28 10:06:53,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-28 10:06:53,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-28 10:06:53,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-28 10:06:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:53,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:53,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-28 10:06:53,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-28 10:06:53,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-28 10:06:53,345 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-28 10:06:53,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-28 10:06:53,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 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; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:53,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:06:53,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:53,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:06:53,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:06:53,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#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); {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11404#true} is VALID [2022-04-28 10:06:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:06:53,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018652674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:53,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:53,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:06:53,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:53,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145151671] [2022-04-28 10:06:53,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145151671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:53,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:53,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:06:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968159770] [2022-04-28 10:06:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 24 [2022-04-28 10:06:53,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:53,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-28 10:06:53,370 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-28 10:06:53,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:06:53,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:06:53,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:06:53,371 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-28 10:06:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:53,942 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2022-04-28 10:06:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:06:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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 24 [2022-04-28 10:06:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-28 10:06:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 10:06:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-28 10:06:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 10:06:53,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 10:06:53,995 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-28 10:06:53,996 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:06:53,997 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:06:53,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:06:53,997 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:53,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:06:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-04-28 10:06:54,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:54,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:54,248 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:54,248 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:54,252 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-28 10:06:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-28 10:06:54,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:54,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:54,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 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 114 states. [2022-04-28 10:06:54,252 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 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 114 states. [2022-04-28 10:06:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:54,254 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-28 10:06:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-28 10:06:54,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:54,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:54,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:54,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2022-04-28 10:06:54,256 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 24 [2022-04-28 10:06:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:54,256 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2022-04-28 10:06:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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-28 10:06:54,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 151 transitions. [2022-04-28 10:06:54,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2022-04-28 10:06:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:06:54,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:54,591 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:54,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:54,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:54,791 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 17 times [2022-04-28 10:06:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:54,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2115219112] [2022-04-28 10:06:54,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:54,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 18 times [2022-04-28 10:06:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:54,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277978977] [2022-04-28 10:06:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:54,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:54,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {12278#(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); {12262#true} is VALID [2022-04-28 10:06:54,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-28 10:06:54,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-28 10:06:54,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:54,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {12278#(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); {12262#true} is VALID [2022-04-28 10:06:54,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-28 10:06:54,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-28 10:06:54,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-28 10:06:54,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12267#(= main_~y~0 0)} is VALID [2022-04-28 10:06:54,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:54,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:54,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:54,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:54,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:54,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:54,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:54,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:54,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:54,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {12277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-28 10:06:54,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-28 10:06:54,932 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-28 10:06:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:54,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277978977] [2022-04-28 10:06:54,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277978977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:54,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612959163] [2022-04-28 10:06:54,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:54,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:54,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:54,933 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-28 10:06:54,940 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-28 10:06:54,976 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:06:54,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:54,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:06:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:54,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:55,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12262#true} is VALID [2022-04-28 10:06:55,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#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); {12262#true} is VALID [2022-04-28 10:06:55,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-28 10:06:55,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-28 10:06:55,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-28 10:06:55,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12267#(= main_~y~0 0)} is VALID [2022-04-28 10:06:55,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:55,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:55,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:55,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:55,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:55,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:55,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:55,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:55,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:55,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:55,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12330#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:55,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {12330#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,191 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-28 10:06:55,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-28 10:06:55,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-28 10:06:55,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-28 10:06:55,192 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-28 10:06:55,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:55,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-28 10:06:55,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-28 10:06:55,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-28 10:06:55,412 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-28 10:06:55,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {12370#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-28 10:06:55,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {12374#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {12370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:55,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {12374#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12374#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:55,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {12381#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12374#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:55,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {12385#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12381#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:55,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {12389#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12385#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:55,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {12393#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12389#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:55,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {12397#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12393#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:55,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {12401#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12397#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:55,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {12405#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12401#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:55,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12405#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:55,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {12413#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12409#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:55,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12413#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:55,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-28 10:06:55,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-28 10:06:55,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-28 10:06:55,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#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); {12262#true} is VALID [2022-04-28 10:06:55,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12262#true} is VALID [2022-04-28 10:06:55,426 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-28 10:06:55,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612959163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:55,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:55,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:06:55,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:55,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2115219112] [2022-04-28 10:06:55,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2115219112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:55,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:55,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:06:55,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146273013] [2022-04-28 10:06:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:55,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:55,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:55,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:55,440 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-28 10:06:55,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:06:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:06:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:06:55,441 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:57,382 INFO L93 Difference]: Finished difference Result 203 states and 304 transitions. [2022-04-28 10:06:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:06:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 10:06:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 10:06:57,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-28 10:06:57,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:57,505 INFO L225 Difference]: With dead ends: 203 [2022-04-28 10:06:57,505 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 10:06:57,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:06:57,506 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:57,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 106 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 10:06:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2022-04-28 10:06:57,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:57,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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-28 10:06:57,806 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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-28 10:06:57,806 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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-28 10:06:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:57,811 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:06:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:06:57,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:57,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:57,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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 186 states. [2022-04-28 10:06:57,812 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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 186 states. [2022-04-28 10:06:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:57,814 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:06:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:06:57,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:57,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:57,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:57,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 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-28 10:06:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2022-04-28 10:06:57,816 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 24 [2022-04-28 10:06:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:57,816 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2022-04-28 10:06:57,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 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-28 10:06:57,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 167 transitions. [2022-04-28 10:06:58,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2022-04-28 10:06:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:06:58,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:58,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:58,172 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-28 10:06:58,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 10:06:58,371 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 13 times [2022-04-28 10:06:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768388215] [2022-04-28 10:06:58,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:58,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 14 times [2022-04-28 10:06:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:58,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234301546] [2022-04-28 10:06:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:58,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {13490#(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); {13478#true} is VALID [2022-04-28 10:06:58,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-28 10:06:58,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-28 10:06:58,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:58,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {13490#(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); {13478#true} is VALID [2022-04-28 10:06:58,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-28 10:06:58,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-28 10:06:58,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-28 10:06:58,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13483#(= main_~y~0 0)} is VALID [2022-04-28 10:06:58,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:58,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:58,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13487#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:58,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {13487#(and (<= main_~z~0 3) (<= 3 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; {13488#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:58,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {13488#(and (<= main_~z~0 2) (<= 2 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; {13489#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:58,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {13489#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-28 10:06:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:06:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234301546] [2022-04-28 10:06:58,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234301546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856573834] [2022-04-28 10:06:58,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:58,477 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-28 10:06:58,478 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-28 10:06:58,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:58,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:58,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:06:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:58,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:58,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13478#true} is VALID [2022-04-28 10:06:58,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#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); {13478#true} is VALID [2022-04-28 10:06:58,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-28 10:06:58,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-28 10:06:58,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-28 10:06:58,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13483#(= main_~y~0 0)} is VALID [2022-04-28 10:06:58,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:58,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:58,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13524#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {13524#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {13528#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:58,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {13528#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= 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; {13532#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {13532#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {13479#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; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-28 10:06:58,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-28 10:06:58,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-28 10:06:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:06:58,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:58,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-28 10:06:58,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {13593#(<= (mod main_~y~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; {13479#false} is VALID [2022-04-28 10:06:58,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {13597#(<= (mod (+ main_~y~0 4294967295) 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; {13593#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:06:58,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {13601#(<= (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; {13597#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:06:58,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {13605#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13601#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:06:58,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {13609#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 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; {13605#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:06:58,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {13613#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~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; {13609#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {13478#true} ~z~0 := ~y~0; {13613#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {13478#true} assume !(~x~0 % 4294967296 > 0); {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#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); {13478#true} is VALID [2022-04-28 10:06:58,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13478#true} is VALID [2022-04-28 10:06:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:06:58,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856573834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:58,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:58,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-28 10:06:58,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:58,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768388215] [2022-04-28 10:06:58,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768388215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:58,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:58,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:06:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393976039] [2022-04-28 10:06:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:58,799 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-28 10:06:58,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:58,800 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-28 10:06:58,816 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-28 10:06:58,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:06:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:06:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:06:58,817 INFO L87 Difference]: Start difference. First operand 122 states and 167 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-28 10:06:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:59,587 INFO L93 Difference]: Finished difference Result 153 states and 201 transitions. [2022-04-28 10:06:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:06:59,588 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-28 10:06:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:59,588 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-28 10:06:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-04-28 10:06:59,589 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-28 10:06:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-04-28 10:06:59,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2022-04-28 10:06:59,626 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-28 10:06:59,627 INFO L225 Difference]: With dead ends: 153 [2022-04-28 10:06:59,627 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 10:06:59,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:06:59,628 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:59,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:06:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 10:06:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2022-04-28 10:06:59,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:59,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:59,919 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:59,919 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:59,924 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-04-28 10:06:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2022-04-28 10:06:59,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:59,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:59,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 141 states. [2022-04-28 10:06:59,925 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 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 141 states. [2022-04-28 10:06:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:59,926 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-04-28 10:06:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2022-04-28 10:06:59,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:59,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:59,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:59,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2022-04-28 10:06:59,928 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 25 [2022-04-28 10:06:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:59,928 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2022-04-28 10:06:59,928 INFO L496 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-28 10:06:59,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 166 transitions. [2022-04-28 10:07:00,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2022-04-28 10:07:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:07:00,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:00,292 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:00,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 10:07:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 10:07:00,493 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 11 times [2022-04-28 10:07:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167959469] [2022-04-28 10:07:00,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:00,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 12 times [2022-04-28 10:07:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:00,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075269944] [2022-04-28 10:07:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:00,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {14508#(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); {14495#true} is VALID [2022-04-28 10:07:00,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-28 10:07:00,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-28 10:07:00,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:00,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {14508#(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); {14495#true} is VALID [2022-04-28 10:07:00,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-28 10:07:00,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-28 10:07:00,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-28 10:07:00,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14500#(= main_~y~0 0)} is VALID [2022-04-28 10:07:00,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {14500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:00,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:00,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14504#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:00,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {14504#(and (<= main_~z~0 3) (<= 3 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; {14505#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:00,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {14505#(and (<= main_~z~0 2) (<= 2 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; {14506#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:00,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {14506#(and (<= main_~z~0 1) (<= 1 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; {14507#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:07:00,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {14507#(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; {14496#false} is VALID [2022-04-28 10:07:00,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {14496#false} assume !(~z~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#false} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-28 10:07:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:07:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075269944] [2022-04-28 10:07:00,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075269944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650137761] [2022-04-28 10:07:00,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:00,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:00,603 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-28 10:07:00,603 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-28 10:07:00,640 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:07:00,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:00,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:07:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:00,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:00,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14495#true} is VALID [2022-04-28 10:07:00,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#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); {14495#true} is VALID [2022-04-28 10:07:00,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-28 10:07:00,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-28 10:07:00,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-28 10:07:00,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14500#(= main_~y~0 0)} is VALID [2022-04-28 10:07:00,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {14500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:00,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:00,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14542#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {14542#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 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; {14546#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:00,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {14546#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= 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; {14550#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:07:00,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {14550#(and (<= main_~y~0 3) (<= 3 main_~y~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; {14554#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {14554#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 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; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {14496#false} assume !(~z~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#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; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#false} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-28 10:07:00,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-28 10:07:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:07:00,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:00,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-28 10:07:00,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-28 10:07:00,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-28 10:07:00,964 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-28 10:07:00,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {14603#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-28 10:07:00,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {14607#(< 0 (mod (+ main_~y~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; {14603#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:00,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {14611#(< 0 (mod (+ main_~y~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; {14607#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:00,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {14615#(< 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; {14611#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:00,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:00,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {14622#(or (not (< 0 (mod main_~z~0 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; {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:00,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {14626#(or (not (< 0 (mod (+ main_~z~0 4294967295) 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; {14622#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:00,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#(or (not (< 0 (mod (+ main_~z~0 4294967294) 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; {14626#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {14634#(or (not (< 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; {14630#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {14495#true} ~z~0 := ~y~0; {14634#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#true} assume !(~x~0 % 4294967296 > 0); {14495#true} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-28 10:07:00,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#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); {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14495#true} is VALID [2022-04-28 10:07:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:07:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650137761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:00,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 10:07:00,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:00,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167959469] [2022-04-28 10:07:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167959469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:07:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618779383] [2022-04-28 10:07:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 25 [2022-04-28 10:07:00,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:00,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:00,984 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-28 10:07:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:07:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:07:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:07:00,985 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:01,831 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-04-28 10:07:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:07:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 25 [2022-04-28 10:07:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 10:07:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-28 10:07:01,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-28 10:07:01,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:01,870 INFO L225 Difference]: With dead ends: 143 [2022-04-28 10:07:01,870 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 10:07:01,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:07:01,871 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:01,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 10:07:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-28 10:07:02,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:02,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:02,182 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:02,182 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:02,183 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-04-28 10:07:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2022-04-28 10:07:02,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:02,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:02,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 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 132 states. [2022-04-28 10:07:02,184 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 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 132 states. [2022-04-28 10:07:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:02,185 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-04-28 10:07:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2022-04-28 10:07:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:02,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:02,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:02,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2022-04-28 10:07:02,186 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 25 [2022-04-28 10:07:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:02,186 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2022-04-28 10:07:02,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:02,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 163 transitions. [2022-04-28 10:07:02,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2022-04-28 10:07:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:07:02,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:02,871 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:02,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 10:07:03,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:03,071 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 15 times [2022-04-28 10:07:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:03,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939727477] [2022-04-28 10:07:03,073 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:03,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 16 times [2022-04-28 10:07:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023561860] [2022-04-28 10:07:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:03,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {15502#(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); {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:03,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {15502#(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); {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-28 10:07:03,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15495#(= main_~y~0 0)} is VALID [2022-04-28 10:07:03,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {15495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:03,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:03,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:03,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:03,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:03,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15500#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:03,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {15500#(and (<= 4 main_~z~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; {15501#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:03,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {15501#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-28 10:07:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:07:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023561860] [2022-04-28 10:07:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023561860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176990634] [2022-04-28 10:07:03,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:03,189 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-28 10:07:03,190 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-28 10:07:03,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:03,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:03,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:07:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:03,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:03,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15490#true} is VALID [2022-04-28 10:07:03,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#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); {15490#true} is VALID [2022-04-28 10:07:03,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-28 10:07:03,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-28 10:07:03,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-28 10:07:03,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15495#(= main_~y~0 0)} is VALID [2022-04-28 10:07:03,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {15495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:03,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:03,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:03,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:03,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:03,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15539#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:03,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {15539#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 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; {15543#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {15543#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-28 10:07:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:07:03,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#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; {15491#false} is VALID [2022-04-28 10:07:03,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {15607#(not (< 0 (mod 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; {15491#false} is VALID [2022-04-28 10:07:03,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {15611#(not (< 0 (mod (+ main_~y~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; {15607#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:03,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {15615#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {15611#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:03,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {15619#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~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; {15615#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {15490#true} ~z~0 := ~y~0; {15619#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {15490#true} assume !(~x~0 % 4294967296 > 0); {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#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); {15490#true} is VALID [2022-04-28 10:07:03,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15490#true} is VALID [2022-04-28 10:07:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 10:07:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176990634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:03,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:07:03,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939727477] [2022-04-28 10:07:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939727477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:03,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:07:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950800827] [2022-04-28 10:07:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:03,436 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-28 10:07:03,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:03,437 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-28 10:07:03,449 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-28 10:07:03,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:07:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:07:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:07:03,450 INFO L87 Difference]: Start difference. First operand 121 states and 163 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-28 10:07:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,403 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-04-28 10:07:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:07:04,403 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-28 10:07:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:04,403 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-28 10:07:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:07:04,404 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-28 10:07:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:07:04,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 10:07:04,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:04,451 INFO L225 Difference]: With dead ends: 164 [2022-04-28 10:07:04,451 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 10:07:04,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:07:04,451 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:04,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 57 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 10:07:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2022-04-28 10:07:04,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:04,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,747 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,747 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,748 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2022-04-28 10:07:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2022-04-28 10:07:04,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 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 152 states. [2022-04-28 10:07:04,749 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 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 152 states. [2022-04-28 10:07:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,750 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2022-04-28 10:07:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2022-04-28 10:07:04,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:04,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2022-04-28 10:07:04,751 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 25 [2022-04-28 10:07:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:04,752 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2022-04-28 10:07:04,752 INFO L496 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-28 10:07:04,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 162 transitions. [2022-04-28 10:07:05,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2022-04-28 10:07:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:07:05,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:05,136 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:05,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 10:07:05,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:05,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:05,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 19 times [2022-04-28 10:07:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:05,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204538591] [2022-04-28 10:07:05,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:05,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 20 times [2022-04-28 10:07:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:05,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131931243] [2022-04-28 10:07:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(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); {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:05,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {16565#(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); {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-28 10:07:05,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-28 10:07:05,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16553#(= main_~y~0 0)} is VALID [2022-04-28 10:07:05,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {16553#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:05,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:05,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:05,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:05,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:05,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:05,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:05,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:05,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:05,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:05,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:05,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16564#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:05,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {16564#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-28 10:07:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131931243] [2022-04-28 10:07:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131931243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828024329] [2022-04-28 10:07:05,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:05,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:05,525 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-28 10:07:05,526 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-28 10:07:05,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:05,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:05,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:07:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:05,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16548#true} is VALID [2022-04-28 10:07:05,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#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); {16548#true} is VALID [2022-04-28 10:07:05,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 10:07:05,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-28 10:07:05,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-28 10:07:05,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16553#(= main_~y~0 0)} is VALID [2022-04-28 10:07:05,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {16553#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:05,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:05,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:05,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:05,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:05,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:05,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:05,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:05,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:05,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:05,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:05,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16620#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {16620#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-28 10:07:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:05,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:06,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-28 10:07:06,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-28 10:07:06,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-28 10:07:06,023 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-28 10:07:06,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:06,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:06,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {16660#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-28 10:07:06,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {16664#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16660#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:06,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {16664#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16664#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:06,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {16671#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16664#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:06,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {16675#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16671#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:06,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {16679#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16675#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:06,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {16683#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16679#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:06,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {16687#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16683#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:06,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16687#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:06,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {16695#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16691#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:06,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {16699#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16695#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:06,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {16703#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16699#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:06,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {16707#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16703#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:06,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16707#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:06,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-28 10:07:06,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-28 10:07:06,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 10:07:06,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#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); {16548#true} is VALID [2022-04-28 10:07:06,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16548#true} is VALID [2022-04-28 10:07:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:06,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828024329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:06,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:06,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:07:06,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204538591] [2022-04-28 10:07:06,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204538591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:06,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:06,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:07:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540340602] [2022-04-28 10:07:06,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:07:06,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:06,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-28 10:07:06,047 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-28 10:07:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:07:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:07:06,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:07:06,048 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-28 10:07:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:08,319 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2022-04-28 10:07:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:07:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:07:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-28 10:07:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-28 10:07:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-28 10:07:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-28 10:07:08,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 127 transitions. [2022-04-28 10:07:08,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:08,416 INFO L225 Difference]: With dead ends: 219 [2022-04-28 10:07:08,416 INFO L226 Difference]: Without dead ends: 202 [2022-04-28 10:07:08,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:08,417 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:08,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 118 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:07:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-28 10:07:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2022-04-28 10:07:08,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:08,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:08,741 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:08,741 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:08,743 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2022-04-28 10:07:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2022-04-28 10:07:08,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:08,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:08,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 202 states. [2022-04-28 10:07:08,744 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 202 states. [2022-04-28 10:07:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:08,746 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2022-04-28 10:07:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2022-04-28 10:07:08,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:08,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:08,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:08,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2022-04-28 10:07:08,748 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 25 [2022-04-28 10:07:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:08,749 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2022-04-28 10:07:08,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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-28 10:07:08,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 178 transitions. [2022-04-28 10:07:09,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2022-04-28 10:07:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:07:09,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:09,132 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:09,153 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-28 10:07:09,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:07:09,347 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 21 times [2022-04-28 10:07:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268309346] [2022-04-28 10:07:09,351 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:09,351 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 22 times [2022-04-28 10:07:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:09,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135169397] [2022-04-28 10:07:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:09,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {17876#(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); {17858#true} is VALID [2022-04-28 10:07:09,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-28 10:07:09,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-28 10:07:09,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:09,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {17876#(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); {17858#true} is VALID [2022-04-28 10:07:09,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-28 10:07:09,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-28 10:07:09,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-28 10:07:09,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17863#(= main_~y~0 0)} is VALID [2022-04-28 10:07:09,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:09,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:09,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:09,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:09,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:09,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:09,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:09,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:09,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:09,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:09,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:09,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:09,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17875#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:09,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {17875#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-28 10:07:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:09,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135169397] [2022-04-28 10:07:09,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135169397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:09,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342440449] [2022-04-28 10:07:09,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:09,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:09,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:09,541 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-28 10:07:09,542 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-28 10:07:09,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:09,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:09,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:07:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:09,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:09,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17858#true} is VALID [2022-04-28 10:07:09,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#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); {17858#true} is VALID [2022-04-28 10:07:09,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-28 10:07:09,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-28 10:07:09,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-28 10:07:09,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17863#(= main_~y~0 0)} is VALID [2022-04-28 10:07:09,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:09,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:09,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:09,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:09,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:09,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:09,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:09,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:09,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:09,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:09,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:09,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:09,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17934#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {17934#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-28 10:07:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:09,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:10,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:10,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {17974#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-28 10:07:10,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {17978#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {17974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:10,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {17978#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17978#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:10,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {17985#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17978#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:10,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {17989#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17985#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:10,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {17993#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17989#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:10,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {17997#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17993#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:10,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {18001#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17997#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:10,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {18005#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18001#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:10,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {18009#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18005#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:10,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {18013#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18009#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:10,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {18017#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18013#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:10,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {18021#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18017#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:10,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {18025#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18021#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:10,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18025#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:10,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-28 10:07:10,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-28 10:07:10,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-28 10:07:10,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#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); {17858#true} is VALID [2022-04-28 10:07:10,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17858#true} is VALID [2022-04-28 10:07:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342440449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:10,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:10,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:07:10,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268309346] [2022-04-28 10:07:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268309346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:10,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:10,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:07:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411675194] [2022-04-28 10:07:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 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 26 [2022-04-28 10:07:10,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:10,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:10,123 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-28 10:07:10,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:07:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:07:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:07:10,123 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:12,800 INFO L93 Difference]: Finished difference Result 236 states and 353 transitions. [2022-04-28 10:07:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:07:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 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 26 [2022-04-28 10:07:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-04-28 10:07:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-04-28 10:07:12,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 137 transitions. [2022-04-28 10:07:12,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:12,900 INFO L225 Difference]: With dead ends: 236 [2022-04-28 10:07:12,900 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 10:07:12,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:07:12,901 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:12,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 126 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:07:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 10:07:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 143. [2022-04-28 10:07:13,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:13,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:13,240 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:13,240 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:13,242 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-28 10:07:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-28 10:07:13,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:13,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:13,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 219 states. [2022-04-28 10:07:13,243 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 219 states. [2022-04-28 10:07:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:13,245 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-28 10:07:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-28 10:07:13,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:13,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:13,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:13,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2022-04-28 10:07:13,247 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 26 [2022-04-28 10:07:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:13,247 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2022-04-28 10:07:13,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:13,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 194 transitions. [2022-04-28 10:07:13,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2022-04-28 10:07:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:07:13,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:13,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:13,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 10:07:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 10:07:13,894 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 17 times [2022-04-28 10:07:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039867136] [2022-04-28 10:07:13,896 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:13,896 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 18 times [2022-04-28 10:07:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370317905] [2022-04-28 10:07:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:14,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {19285#(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); {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:14,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {19285#(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); {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-28 10:07:14,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-28 10:07:14,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:14,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19274#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:14,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {19274#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19275#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:07:14,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {19275#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19276#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 10:07:14,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {19276#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:07:14,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:07:14,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~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; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:14,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~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; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:14,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~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; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:14,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~z~0 % 4294967296 > 0); {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:14,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:14,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~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; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:14,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= 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; {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:14,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:14,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:14,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:14,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:14,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:14,221 INFO L272 TraceCheckUtils]: 23: Hoare triple {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19283#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:07:14,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {19283#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19284#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:07:14,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {19284#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19269#false} is VALID [2022-04-28 10:07:14,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-28 10:07:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370317905] [2022-04-28 10:07:14,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370317905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399774359] [2022-04-28 10:07:14,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:14,223 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-28 10:07:14,224 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-28 10:07:14,288 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:07:14,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:07:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:14,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:15,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19268#true} is VALID [2022-04-28 10:07:15,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#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); {19268#true} is VALID [2022-04-28 10:07:15,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-28 10:07:15,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-28 10:07:15,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-28 10:07:15,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:15,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19307#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:07:15,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {19307#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19311#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:07:15,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {19311#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19315#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-28 10:07:15,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {19315#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:07:15,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:07:15,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~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; {19326#(and (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {19326#(and (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 3) (<= (mod (+ main_~n~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; {19330#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {19330#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~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; {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~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; {19341#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-28 10:07:15,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {19341#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 3 (+ 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; {19345#(and (= (+ main_~y~0 2) 3) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {19345#(and (= (+ main_~y~0 2) 3) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~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; {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 10:07:15,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:15,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:15,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:15,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:07:15,016 INFO L272 TraceCheckUtils]: 23: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:15,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:15,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {19372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19269#false} is VALID [2022-04-28 10:07:15,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-28 10:07:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:15,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:16,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-28 10:07:16,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {19372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19269#false} is VALID [2022-04-28 10:07:16,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:16,023 INFO L272 TraceCheckUtils]: 23: Hoare triple {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:16,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:16,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {19395#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:16,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {19399#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19395#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:16,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19399#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:16,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:07:16,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {19410#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 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; {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:07:16,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {19414#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 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; {19410#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:07:16,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod 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; {19414#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:07:16,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {19425#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (= (mod main_~n~0 4294967296) (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; {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {19429#(or (<= (mod (+ main_~x~0 2) 4294967296) 0) (= (mod main_~n~0 4294967296) (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; {19425#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (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; {19429#(or (<= (mod (+ main_~x~0 2) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {19440#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {19444#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19440#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {19448#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19444#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:07:16,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {19452#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19448#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:07:16,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19452#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:16,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-28 10:07:16,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-28 10:07:16,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-28 10:07:16,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#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); {19268#true} is VALID [2022-04-28 10:07:16,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19268#true} is VALID [2022-04-28 10:07:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399774359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:16,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:16,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2022-04-28 10:07:16,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:16,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039867136] [2022-04-28 10:07:16,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039867136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:16,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:16,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:07:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16264941] [2022-04-28 10:07:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:07:16,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:16,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:16,076 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-28 10:07:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:07:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:07:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:07:16,077 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:18,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:07:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:19,203 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2022-04-28 10:07:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:07:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:07:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-28 10:07:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-28 10:07:19,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-28 10:07:19,279 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-28 10:07:19,280 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:07:19,280 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 10:07:19,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=337, Invalid=2419, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:07:19,281 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:19,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 68 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:07:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 10:07:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-28 10:07:19,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:19,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,652 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,653 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:19,654 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-28 10:07:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-28 10:07:19,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:19,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:19,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 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 151 states. [2022-04-28 10:07:19,654 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 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 151 states. [2022-04-28 10:07:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:19,656 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-28 10:07:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-28 10:07:19,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:19,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:19,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:19,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 199 transitions. [2022-04-28 10:07:19,658 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 199 transitions. Word has length 27 [2022-04-28 10:07:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:19,658 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 199 transitions. [2022-04-28 10:07:19,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:19,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 199 transitions. [2022-04-28 10:07:20,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 199 transitions. [2022-04-28 10:07:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:07:20,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:20,091 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:20,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 10:07:20,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:07:20,299 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 19 times [2022-04-28 10:07:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609113809] [2022-04-28 10:07:20,302 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:20,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 20 times [2022-04-28 10:07:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:20,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841948775] [2022-04-28 10:07:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:20,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {20420#(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); {20407#true} is VALID [2022-04-28 10:07:20,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:20,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {20420#(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); {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-28 10:07:20,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20412#(= main_~y~0 0)} is VALID [2022-04-28 10:07:20,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {20412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:20,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:20,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:20,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {20417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:20,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {20417#(and (<= 4 main_~z~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; {20418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:20,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {20418#(and (<= main_~z~0 3) (<= 3 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; {20419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:20,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {20419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-28 10:07:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:07:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:20,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841948775] [2022-04-28 10:07:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841948775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:20,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576174897] [2022-04-28 10:07:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:20,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:20,430 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-28 10:07:20,431 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-28 10:07:20,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:20,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:20,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:07:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:20,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:20,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20407#true} is VALID [2022-04-28 10:07:20,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#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); {20407#true} is VALID [2022-04-28 10:07:20,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-28 10:07:20,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-28 10:07:20,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-28 10:07:20,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20412#(= main_~y~0 0)} is VALID [2022-04-28 10:07:20,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {20412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:20,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:20,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:20,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {20457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {20457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 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; {20461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {20461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= 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; {20465#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {20465#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-28 10:07:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:07:20,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#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; {20408#false} is VALID [2022-04-28 10:07:20,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {20532#(<= (mod main_~y~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; {20408#false} is VALID [2022-04-28 10:07:20,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#(<= (mod (+ main_~y~0 4294967295) 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; {20532#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:07:20,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {20540#(<= (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; {20536#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:07:20,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {20544#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20540#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:07:20,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {20548#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 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; {20544#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {20552#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~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; {20548#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {20407#true} ~z~0 := ~y~0; {20552#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {20407#true} assume !(~x~0 % 4294967296 > 0); {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#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); {20407#true} is VALID [2022-04-28 10:07:20,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20407#true} is VALID [2022-04-28 10:07:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 10:07:20,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576174897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:20,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:20,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-28 10:07:20,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:20,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609113809] [2022-04-28 10:07:20,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609113809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:20,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:20,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:07:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606760642] [2022-04-28 10:07:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 27 [2022-04-28 10:07:20,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:20,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:20,787 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-28 10:07:20,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:07:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:07:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:07:20,788 INFO L87 Difference]: Start difference. First operand 148 states and 199 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:21,917 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2022-04-28 10:07:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:07:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 27 [2022-04-28 10:07:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 10:07:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 10:07:21,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-28 10:07:21,964 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-28 10:07:21,966 INFO L225 Difference]: With dead ends: 187 [2022-04-28 10:07:21,966 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 10:07:21,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:07:21,967 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:21,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 60 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 10:07:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2022-04-28 10:07:22,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:22,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,344 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,344 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:22,346 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2022-04-28 10:07:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2022-04-28 10:07:22,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:22,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:22,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 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 174 states. [2022-04-28 10:07:22,347 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 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 174 states. [2022-04-28 10:07:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:22,348 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2022-04-28 10:07:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2022-04-28 10:07:22,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:22,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:22,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:22,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2022-04-28 10:07:22,350 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 27 [2022-04-28 10:07:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:22,350 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2022-04-28 10:07:22,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:22,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 198 transitions. [2022-04-28 10:07:22,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2022-04-28 10:07:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:07:22,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:22,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:22,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 10:07:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:23,154 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 13 times [2022-04-28 10:07:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:23,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584359991] [2022-04-28 10:07:23,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:23,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 14 times [2022-04-28 10:07:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207520288] [2022-04-28 10:07:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {21642#(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); {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:23,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {21642#(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); {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-28 10:07:23,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-28 10:07:23,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21629#true} is VALID [2022-04-28 10:07:23,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {21629#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21634#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:23,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {21634#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21635#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:07:23,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {21635#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21636#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:07:23,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:07:23,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:07:23,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:07:23,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 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; {21638#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:07:23,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {21638#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 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; {21639#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:07:23,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {21639#(<= (+ 2 (* (div (+ main_~x~0 2) 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; {21640#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:07:23,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {21640#(<= (+ 3 (* (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; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {21641#(<= (+ 4 (* 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; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {21641#(<= (+ 4 (* 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; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {21641#(<= (+ 4 (* 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; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {21641#(<= (+ 4 (* 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; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:07:23,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {21630#false} is VALID [2022-04-28 10:07:23,301 INFO L272 TraceCheckUtils]: 23: Hoare triple {21630#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21630#false} is VALID [2022-04-28 10:07:23,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {21630#false} ~cond := #in~cond; {21630#false} is VALID [2022-04-28 10:07:23,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#false} assume 0 == ~cond; {21630#false} is VALID [2022-04-28 10:07:23,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-28 10:07:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:23,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207520288] [2022-04-28 10:07:23,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207520288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:23,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262616541] [2022-04-28 10:07:23,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:23,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:23,302 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-28 10:07:23,303 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-28 10:07:23,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:23,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:23,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:07:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:23,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21629#true} is VALID [2022-04-28 10:07:23,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#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); {21629#true} is VALID [2022-04-28 10:07:23,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-28 10:07:23,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-28 10:07:23,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-28 10:07:23,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21665#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:07:23,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {21665#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:07:23,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:07:23,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:07:23,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !(~x~0 % 4294967296 > 0); {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:07:23,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} ~z~0 := ~y~0; {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:07:23,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ 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; {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-28 10:07:23,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {21673#(= (+ (- 1) main_~n~0) (+ main_~x~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; {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-28 10:07:23,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~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; {21665#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:07:23,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {21665#(= (+ main_~x~0 1) main_~n~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; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {21661#(= main_~n~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; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {21661#(= main_~n~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; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {21661#(= main_~n~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; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {21661#(= main_~n~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; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:07:23,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {21714#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 10:07:23,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {21714#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {21718#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-28 10:07:23,824 INFO L272 TraceCheckUtils]: 23: Hoare triple {21718#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:23,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:23,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {21726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21630#false} is VALID [2022-04-28 10:07:23,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-28 10:07:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:23,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:24,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-28 10:07:24,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {21726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21630#false} is VALID [2022-04-28 10:07:24,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:24,267 INFO L272 TraceCheckUtils]: 23: Hoare triple {21742#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:24,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {21746#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {21742#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:24,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {21746#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:24,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~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; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~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; {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:07:24,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~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; {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:07:24,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:07:24,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:24,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-28 10:07:24,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-28 10:07:24,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-28 10:07:24,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#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); {21629#true} is VALID [2022-04-28 10:07:24,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21629#true} is VALID [2022-04-28 10:07:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:24,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262616541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:24,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:24,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-04-28 10:07:24,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:24,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584359991] [2022-04-28 10:07:24,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584359991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:24,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:24,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:07:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782800708] [2022-04-28 10:07:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:24,277 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 27 [2022-04-28 10:07:24,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:24,277 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-28 10:07:24,300 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-28 10:07:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:07:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:07:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:07:24,301 INFO L87 Difference]: Start difference. First operand 148 states and 198 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-28 10:07:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:25,367 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2022-04-28 10:07:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:07:25,368 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 27 [2022-04-28 10:07:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:25,368 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-28 10:07:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:07:25,368 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-28 10:07:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 10:07:25,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 10:07:25,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:25,431 INFO L225 Difference]: With dead ends: 186 [2022-04-28 10:07:25,431 INFO L226 Difference]: Without dead ends: 181 [2022-04-28 10:07:25,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:07:25,433 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:25,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 44 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-28 10:07:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2022-04-28 10:07:25,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:25,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:25,913 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:25,913 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:25,914 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-28 10:07:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-28 10:07:25,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:25,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:25,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 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 181 states. [2022-04-28 10:07:25,915 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 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 181 states. [2022-04-28 10:07:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:25,916 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-28 10:07:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-28 10:07:25,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:25,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:25,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:25,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-04-28 10:07:25,919 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 27 [2022-04-28 10:07:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:25,919 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-04-28 10:07:25,919 INFO L496 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-28 10:07:25,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 226 transitions. [2022-04-28 10:07:26,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-04-28 10:07:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:07:26,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:26,791 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:26,807 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-28 10:07:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:27,003 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 21 times [2022-04-28 10:07:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:27,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [956899949] [2022-04-28 10:07:27,005 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:27,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 22 times [2022-04-28 10:07:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:27,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393038944] [2022-04-28 10:07:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {22915#(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); {22902#true} is VALID [2022-04-28 10:07:27,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-28 10:07:27,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-28 10:07:27,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:27,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {22915#(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); {22902#true} is VALID [2022-04-28 10:07:27,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-28 10:07:27,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-28 10:07:27,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-28 10:07:27,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22907#(= main_~y~0 0)} is VALID [2022-04-28 10:07:27,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {22907#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:27,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:27,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:27,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:27,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:27,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:27,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:27,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {22913#(and (<= main_~z~0 5) (<= 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; {22914#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {22914#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-28 10:07:27,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-28 10:07:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:07:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393038944] [2022-04-28 10:07:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393038944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092695915] [2022-04-28 10:07:27,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:27,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:27,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:27,130 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-28 10:07:27,130 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-28 10:07:27,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:27,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:27,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:07:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:27,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22902#true} is VALID [2022-04-28 10:07:27,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#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); {22902#true} is VALID [2022-04-28 10:07:27,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-28 10:07:27,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-28 10:07:27,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-28 10:07:27,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22907#(= main_~y~0 0)} is VALID [2022-04-28 10:07:27,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {22907#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:27,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:27,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:27,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:27,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:27,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:27,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:27,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {22913#(and (<= main_~z~0 5) (<= 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; {22958#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:27,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {22958#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-28 10:07:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:07:27,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#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; {22903#false} is VALID [2022-04-28 10:07:27,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {23034#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-28 10:07:27,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {23038#(< 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; {23034#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:27,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {23038#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:27,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:27,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:27,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {23053#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23049#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:27,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {23057#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23053#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:27,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {23061#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:27,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {23065#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23061#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:27,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23065#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:27,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-28 10:07:27,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-28 10:07:27,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-28 10:07:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#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); {22902#true} is VALID [2022-04-28 10:07:27,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22902#true} is VALID [2022-04-28 10:07:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:07:27,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092695915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:27,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:27,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:07:27,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [956899949] [2022-04-28 10:07:27,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [956899949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:27,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:27,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:07:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394724222] [2022-04-28 10:07:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 27 [2022-04-28 10:07:27,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:27,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:27,503 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-28 10:07:27,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:07:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:07:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:07:27,504 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:28,931 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2022-04-28 10:07:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:07:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 27 [2022-04-28 10:07:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-04-28 10:07:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-04-28 10:07:28,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2022-04-28 10:07:28,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:28,984 INFO L225 Difference]: With dead ends: 225 [2022-04-28 10:07:28,984 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 10:07:28,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:07:28,985 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:28,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 72 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 10:07:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2022-04-28 10:07:29,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:29,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:29,453 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:29,453 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:29,455 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2022-04-28 10:07:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 277 transitions. [2022-04-28 10:07:29,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:29,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:29,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 10:07:29,456 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 10:07:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:29,458 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2022-04-28 10:07:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 277 transitions. [2022-04-28 10:07:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:29,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:29,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:29,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-04-28 10:07:29,462 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 27 [2022-04-28 10:07:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:29,463 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-04-28 10:07:29,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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-28 10:07:29,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 225 transitions. [2022-04-28 10:07:30,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-04-28 10:07:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:07:30,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:30,406 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:30,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:30,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:30,606 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 23 times [2022-04-28 10:07:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:30,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437999632] [2022-04-28 10:07:30,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:30,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 24 times [2022-04-28 10:07:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:30,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457510822] [2022-04-28 10:07:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:30,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {24329#(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); {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24329#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:30,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {24329#(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); {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-28 10:07:30,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-28 10:07:30,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24315#(= main_~y~0 0)} is VALID [2022-04-28 10:07:30,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {24315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:30,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:30,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:30,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:30,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:30,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:30,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:30,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:30,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:30,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:30,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:30,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:30,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24328#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {24328#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-28 10:07:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:30,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457510822] [2022-04-28 10:07:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457510822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411343086] [2022-04-28 10:07:30,798 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:30,799 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:30,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:07:30,873 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:07:30,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:30,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:07:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:30,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:31,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24310#true} is VALID [2022-04-28 10:07:31,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#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); {24310#true} is VALID [2022-04-28 10:07:31,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-28 10:07:31,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-28 10:07:31,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-28 10:07:31,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24315#(= main_~y~0 0)} is VALID [2022-04-28 10:07:31,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {24315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:31,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:31,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:31,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:31,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:31,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:31,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:31,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:31,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:31,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:31,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:31,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:31,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:31,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {24390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-28 10:07:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:31,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:31,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {24430#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-28 10:07:31,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {24434#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24430#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:31,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {24434#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:31,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {24441#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:31,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {24445#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24441#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:31,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {24449#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24445#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:31,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {24453#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24449#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:31,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {24457#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24453#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:31,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {24461#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24457#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:31,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {24465#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24461#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:31,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {24469#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24465#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:31,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {24473#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24469#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:31,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {24477#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24473#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:31,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {24481#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24477#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:31,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {24485#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24481#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:31,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24485#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:31,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-28 10:07:31,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-28 10:07:31,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-28 10:07:31,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#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); {24310#true} is VALID [2022-04-28 10:07:31,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24310#true} is VALID [2022-04-28 10:07:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411343086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:31,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:31,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:07:31,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437999632] [2022-04-28 10:07:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437999632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:31,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:31,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:07:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979838628] [2022-04-28 10:07:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:31,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:31,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:31,489 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-28 10:07:31,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:07:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:07:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:07:31,490 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:34,708 INFO L93 Difference]: Finished difference Result 296 states and 446 transitions. [2022-04-28 10:07:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:07:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2022-04-28 10:07:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2022-04-28 10:07:34,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 147 transitions. [2022-04-28 10:07:34,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:34,818 INFO L225 Difference]: With dead ends: 296 [2022-04-28 10:07:34,818 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 10:07:34,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:07:34,819 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:34,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 136 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:07:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 10:07:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 179. [2022-04-28 10:07:35,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:35,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:35,319 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:35,319 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:35,322 INFO L93 Difference]: Finished difference Result 277 states and 355 transitions. [2022-04-28 10:07:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-04-28 10:07:35,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:35,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:35,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 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 277 states. [2022-04-28 10:07:35,322 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 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 277 states. [2022-04-28 10:07:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:35,325 INFO L93 Difference]: Finished difference Result 277 states and 355 transitions. [2022-04-28 10:07:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-04-28 10:07:35,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:35,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:35,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:35,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2022-04-28 10:07:35,328 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 27 [2022-04-28 10:07:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:35,328 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2022-04-28 10:07:35,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-28 10:07:35,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 244 transitions. [2022-04-28 10:07:37,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2022-04-28 10:07:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:07:37,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:37,022 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:37,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:37,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 10:07:37,223 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:37,223 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 23 times [2022-04-28 10:07:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:37,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625291242] [2022-04-28 10:07:37,225 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:37,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 24 times [2022-04-28 10:07:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099425161] [2022-04-28 10:07:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {26047#(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); {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#(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); {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= 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; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= 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; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-28 10:07:37,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-28 10:07:37,314 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-28 10:07:37,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-28 10:07:37,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-28 10:07:37,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-28 10:07:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:07:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:37,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099425161] [2022-04-28 10:07:37,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099425161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:37,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023816012] [2022-04-28 10:07:37,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:37,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:37,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:37,317 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:37,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:07:37,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:07:37,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:37,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:07:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:37,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#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); {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= 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; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= 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; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-28 10:07:37,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-28 10:07:37,565 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-28 10:07:37,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-28 10:07:37,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-28 10:07:37,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-28 10:07:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:07:37,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:37,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-28 10:07:37,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-28 10:07:37,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-28 10:07:37,751 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-28 10:07:37,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-28 10:07:37,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-28 10:07:37,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= 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; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= 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; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:07:37,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= 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; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:07:37,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:07:37,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#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); {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26038#true} is VALID [2022-04-28 10:07:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:07:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023816012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:37,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:37,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-28 10:07:37,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:37,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1625291242] [2022-04-28 10:07:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1625291242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:37,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:37,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:07:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639133082] [2022-04-28 10:07:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:37,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:37,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:37,778 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-28 10:07:37,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:07:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:07:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:07:37,778 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:38,659 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2022-04-28 10:07:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:07:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:07:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 10:07:38,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 10:07:38,693 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-28 10:07:38,695 INFO L225 Difference]: With dead ends: 197 [2022-04-28 10:07:38,695 INFO L226 Difference]: Without dead ends: 178 [2022-04-28 10:07:38,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:07:38,696 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:38,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:07:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-28 10:07:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-28 10:07:39,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:39,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:39,217 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:39,218 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:39,223 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-28 10:07:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-28 10:07:39,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:39,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:39,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 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-28 10:07:39,224 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 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-28 10:07:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:39,225 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-28 10:07:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-28 10:07:39,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:39,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:39,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:39,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 10:07:39,228 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 28 [2022-04-28 10:07:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:39,228 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 10:07:39,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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-28 10:07:39,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 10:07:39,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 10:07:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:07:39,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:39,835 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:39,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:40,036 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 15 times [2022-04-28 10:07:40,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:40,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236886217] [2022-04-28 10:07:40,038 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:40,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 16 times [2022-04-28 10:07:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:40,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804067846] [2022-04-28 10:07:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:40,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {27338#(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); {27323#true} is VALID [2022-04-28 10:07:40,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-28 10:07:40,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-28 10:07:40,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:40,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {27338#(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); {27323#true} is VALID [2022-04-28 10:07:40,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-28 10:07:40,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-28 10:07:40,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-28 10:07:40,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27328#(= main_~y~0 0)} is VALID [2022-04-28 10:07:40,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {27328#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:40,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:40,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:40,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {27333#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:40,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {27333#(and (<= 4 main_~z~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; {27334#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:40,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {27334#(and (<= main_~z~0 3) (<= 3 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; {27335#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:40,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {27335#(and (<= main_~z~0 2) (<= 2 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; {27336#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:40,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {27336#(and (<= main_~z~0 1) (<= 1 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; {27337#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {27337#(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; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {27324#false} assume !(~z~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {27324#false} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-28 10:07:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804067846] [2022-04-28 10:07:40,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804067846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304596130] [2022-04-28 10:07:40,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:40,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:40,173 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:07:40,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:40,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:40,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:07:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:40,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:40,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27323#true} is VALID [2022-04-28 10:07:40,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#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); {27323#true} is VALID [2022-04-28 10:07:40,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-28 10:07:40,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-28 10:07:40,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-28 10:07:40,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27328#(= main_~y~0 0)} is VALID [2022-04-28 10:07:40,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {27328#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:40,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:40,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:40,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {27375#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {27375#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 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; {27379#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:40,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {27379#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= 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; {27383#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {27383#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~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; {27387#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {27387#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 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; {27391#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {27391#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 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; {27324#false} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {27324#false} assume !(~z~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {27324#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; {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {27324#false} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-28 10:07:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:40,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:40,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-28 10:07:40,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-28 10:07:40,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-28 10:07:40,654 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-28 10:07:40,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {27443#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-28 10:07:40,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {27447#(< 0 (mod (+ main_~y~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; {27443#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:40,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {27451#(< 0 (mod (+ main_~y~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; {27447#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:40,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {27455#(< 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; {27451#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:40,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {27459#(< 0 (mod (+ 4294967292 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; {27455#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:40,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {27466#(or (not (< 0 (mod main_~z~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; {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {27470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 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; {27466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:40,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {27474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 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; {27470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:40,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {27478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 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; {27474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {27482#(or (not (< 0 (mod (+ 4294967292 main_~z~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; {27478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {27323#true} ~z~0 := ~y~0; {27482#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {27323#true} assume !(~x~0 % 4294967296 > 0); {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-28 10:07:40,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#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); {27323#true} is VALID [2022-04-28 10:07:40,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27323#true} is VALID [2022-04-28 10:07:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:07:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304596130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:40,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-28 10:07:40,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236886217] [2022-04-28 10:07:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236886217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:40,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:07:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039838658] [2022-04-28 10:07:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:40,662 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 28 [2022-04-28 10:07:40,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:40,663 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-28 10:07:40,677 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-28 10:07:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:07:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:07:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:07:40,678 INFO L87 Difference]: Start difference. First operand 175 states and 239 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-28 10:07:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:42,006 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2022-04-28 10:07:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:42,006 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 28 [2022-04-28 10:07:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:42,006 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-28 10:07:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2022-04-28 10:07:42,007 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-28 10:07:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2022-04-28 10:07:42,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 58 transitions. [2022-04-28 10:07:42,046 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-28 10:07:42,048 INFO L225 Difference]: With dead ends: 208 [2022-04-28 10:07:42,048 INFO L226 Difference]: Without dead ends: 187 [2022-04-28 10:07:42,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:07:42,049 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:42,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:07:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-28 10:07:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-04-28 10:07:42,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:42,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:42,578 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:42,578 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:42,580 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2022-04-28 10:07:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-28 10:07:42,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:42,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:42,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 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 187 states. [2022-04-28 10:07:42,581 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 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 187 states. [2022-04-28 10:07:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:42,582 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2022-04-28 10:07:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-28 10:07:42,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:42,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:42,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:42,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-28 10:07:42,584 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 28 [2022-04-28 10:07:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:42,585 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-28 10:07:42,585 INFO L496 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-28 10:07:42,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 235 transitions. [2022-04-28 10:07:43,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-28 10:07:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:07:43,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:43,250 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:43,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:43,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:43,451 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 25 times [2022-04-28 10:07:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715718073] [2022-04-28 10:07:43,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:43,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 26 times [2022-04-28 10:07:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:43,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458553136] [2022-04-28 10:07:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {28715#(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); {28695#true} is VALID [2022-04-28 10:07:43,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-28 10:07:43,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-28 10:07:43,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:43,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {28715#(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); {28695#true} is VALID [2022-04-28 10:07:43,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-28 10:07:43,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-28 10:07:43,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-28 10:07:43,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28700#(= main_~y~0 0)} is VALID [2022-04-28 10:07:43,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {28700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:43,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:43,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:43,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:43,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:43,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:43,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:43,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:43,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:43,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:43,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:43,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:43,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:43,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {28714#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:43,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {28714#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:43,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:43,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:43,728 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-28 10:07:43,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-28 10:07:43,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-28 10:07:43,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-28 10:07:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:43,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458553136] [2022-04-28 10:07:43,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458553136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:43,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380033019] [2022-04-28 10:07:43,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:43,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:43,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:43,730 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:43,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:07:43,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:43,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:43,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:07:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:43,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28695#true} is VALID [2022-04-28 10:07:43,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#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); {28695#true} is VALID [2022-04-28 10:07:43,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-28 10:07:43,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-28 10:07:43,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-28 10:07:43,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28700#(= main_~y~0 0)} is VALID [2022-04-28 10:07:43,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {28700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:43,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:43,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:43,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:43,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:43,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:43,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:43,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:44,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:44,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:44,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:44,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:44,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {28779#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {28779#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-28 10:07:44,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-28 10:07:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:44,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:44,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-28 10:07:44,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-28 10:07:44,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-28 10:07:44,369 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-28 10:07:44,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {28819#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-28 10:07:44,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {28823#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {28819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:44,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {28823#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28823#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:44,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {28830#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28823#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:44,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {28834#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28830#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:44,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {28838#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28834#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:44,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {28842#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28838#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:44,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {28846#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28842#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:44,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {28850#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28846#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {28854#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28850#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:44,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {28858#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28854#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {28862#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28858#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:44,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {28866#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28862#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:44,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {28870#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28866#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:44,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {28874#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28870#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28874#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28878#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:07:44,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-28 10:07:44,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#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); {28695#true} is VALID [2022-04-28 10:07:44,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28695#true} is VALID [2022-04-28 10:07:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:44,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380033019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:44,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:44,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:07:44,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715718073] [2022-04-28 10:07:44,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715718073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:44,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:44,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:07:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642575953] [2022-04-28 10:07:44,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:44,379 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:07:44,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:44,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-28 10:07:44,394 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-28 10:07:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:07:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:07:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:07:44,395 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-28 10:07:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,131 INFO L93 Difference]: Finished difference Result 313 states and 471 transitions. [2022-04-28 10:07:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:07:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:07:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-28 10:07:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2022-04-28 10:07:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-28 10:07:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2022-04-28 10:07:48,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 153 transitions. [2022-04-28 10:07:48,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:48,245 INFO L225 Difference]: With dead ends: 313 [2022-04-28 10:07:48,245 INFO L226 Difference]: Without dead ends: 293 [2022-04-28 10:07:48,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:07:48,246 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 110 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:48,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 143 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:07:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-04-28 10:07:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-04-28 10:07:48,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:48,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,835 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,836 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,839 INFO L93 Difference]: Finished difference Result 293 states and 374 transitions. [2022-04-28 10:07:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 374 transitions. [2022-04-28 10:07:48,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:48,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:48,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 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 293 states. [2022-04-28 10:07:48,839 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 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 293 states. [2022-04-28 10:07:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:48,843 INFO L93 Difference]: Finished difference Result 293 states and 374 transitions. [2022-04-28 10:07:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 374 transitions. [2022-04-28 10:07:48,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:48,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:48,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:48,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2022-04-28 10:07:48,845 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 28 [2022-04-28 10:07:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:48,845 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2022-04-28 10:07:48,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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-28 10:07:48,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 254 transitions. [2022-04-28 10:07:49,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2022-04-28 10:07:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:49,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:49,582 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:49,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:49,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:07:49,782 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 25 times [2022-04-28 10:07:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:49,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564141192] [2022-04-28 10:07:49,784 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:49,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 26 times [2022-04-28 10:07:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:49,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011459793] [2022-04-28 10:07:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:49,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {30529#(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); {30515#true} is VALID [2022-04-28 10:07:49,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-28 10:07:49,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-28 10:07:49,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:49,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#(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); {30515#true} is VALID [2022-04-28 10:07:49,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-28 10:07:49,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-28 10:07:49,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-28 10:07:49,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30520#(= main_~y~0 0)} is VALID [2022-04-28 10:07:49,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {30520#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:49,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:49,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:49,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:49,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:49,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:49,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30526#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:49,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {30526#(and (<= main_~z~0 5) (<= 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; {30527#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:49,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {30527#(and (<= 4 main_~z~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; {30528#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:49,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {30528#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:49,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-28 10:07:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:07:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:49,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011459793] [2022-04-28 10:07:49,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011459793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:49,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169377335] [2022-04-28 10:07:49,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:49,966 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:49,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:07:50,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:50,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:07:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:50,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:50,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30515#true} is VALID [2022-04-28 10:07:50,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#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); {30515#true} is VALID [2022-04-28 10:07:50,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-28 10:07:50,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-28 10:07:50,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-28 10:07:50,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30520#(= main_~y~0 0)} is VALID [2022-04-28 10:07:50,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {30520#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:50,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:50,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:50,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:50,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:50,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:50,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30569#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:50,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {30569#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 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; {30573#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {30573#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= 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; {30577#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {30577#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-28 10:07:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:07:50,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:50,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#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; {30516#false} is VALID [2022-04-28 10:07:50,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {30650#(not (< 0 (mod 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; {30516#false} is VALID [2022-04-28 10:07:50,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {30654#(not (< 0 (mod (+ main_~y~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; {30650#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:50,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {30658#(not (< 0 (mod (+ main_~y~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; {30654#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:50,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {30662#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {30658#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:50,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {30666#(or (not (< 0 (mod (+ main_~y~0 4294967294) 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; {30662#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:07:50,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {30670#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~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; {30666#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {30515#true} ~z~0 := ~y~0; {30670#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {30515#true} assume !(~x~0 % 4294967296 > 0); {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#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); {30515#true} is VALID [2022-04-28 10:07:50,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30515#true} is VALID [2022-04-28 10:07:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:07:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169377335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:50,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:50,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:07:50,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564141192] [2022-04-28 10:07:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564141192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:50,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:50,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:07:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516532104] [2022-04-28 10:07:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:50,321 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 29 [2022-04-28 10:07:50,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:50,322 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-28 10:07:50,342 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-28 10:07:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:07:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:07:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:07:50,342 INFO L87 Difference]: Start difference. First operand 187 states and 254 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-28 10:07:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,990 INFO L93 Difference]: Finished difference Result 239 states and 311 transitions. [2022-04-28 10:07:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:07:51,990 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 29 [2022-04-28 10:07:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:51,991 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-28 10:07:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-28 10:07:51,991 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-28 10:07:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-28 10:07:51,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-28 10:07:52,045 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-28 10:07:52,047 INFO L225 Difference]: With dead ends: 239 [2022-04-28 10:07:52,047 INFO L226 Difference]: Without dead ends: 225 [2022-04-28 10:07:52,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:07:52,048 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:52,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 76 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-28 10:07:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 187. [2022-04-28 10:07:52,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:52,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,624 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,624 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,626 INFO L93 Difference]: Finished difference Result 225 states and 297 transitions. [2022-04-28 10:07:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 297 transitions. [2022-04-28 10:07:52,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 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 225 states. [2022-04-28 10:07:52,627 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 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 225 states. [2022-04-28 10:07:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,629 INFO L93 Difference]: Finished difference Result 225 states and 297 transitions. [2022-04-28 10:07:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 297 transitions. [2022-04-28 10:07:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:52,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2022-04-28 10:07:52,631 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 29 [2022-04-28 10:07:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:52,631 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2022-04-28 10:07:52,632 INFO L496 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-28 10:07:52,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 253 transitions. [2022-04-28 10:07:53,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2022-04-28 10:07:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:53,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:53,896 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:53,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:54,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 10:07:54,115 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 27 times [2022-04-28 10:07:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:54,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812395791] [2022-04-28 10:07:54,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:54,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 28 times [2022-04-28 10:07:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:54,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864432217] [2022-04-28 10:07:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {32050#(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); {32036#true} is VALID [2022-04-28 10:07:54,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-28 10:07:54,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-28 10:07:54,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:54,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {32050#(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); {32036#true} is VALID [2022-04-28 10:07:54,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-28 10:07:54,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-28 10:07:54,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-28 10:07:54,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32041#(= main_~y~0 0)} is VALID [2022-04-28 10:07:54,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:54,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:54,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:54,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:54,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:54,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:54,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {32048#(and (<= main_~z~0 6) (<= 6 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; {32049#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {32049#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-28 10:07:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:07:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:54,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864432217] [2022-04-28 10:07:54,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864432217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:54,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311919451] [2022-04-28 10:07:54,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:54,232 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:54,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:07:54,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:54,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:54,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:07:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:54,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:54,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32036#true} is VALID [2022-04-28 10:07:54,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#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); {32036#true} is VALID [2022-04-28 10:07:54,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-28 10:07:54,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-28 10:07:54,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-28 10:07:54,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32041#(= main_~y~0 0)} is VALID [2022-04-28 10:07:54,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:54,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:54,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:54,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:54,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:54,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:54,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:54,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:54,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {32048#(and (<= main_~z~0 6) (<= 6 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; {32096#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {32096#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-28 10:07:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:07:54,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#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; {32037#false} is VALID [2022-04-28 10:07:54,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {32178#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-28 10:07:54,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {32182#(< 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; {32178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:54,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32182#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {32193#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {32197#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32193#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:54,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {32201#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32197#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:54,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {32205#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32201#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:54,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {32209#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32205#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:54,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {32213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32209#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:54,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:54,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-28 10:07:54,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-28 10:07:54,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-28 10:07:54,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#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); {32036#true} is VALID [2022-04-28 10:07:54,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32036#true} is VALID [2022-04-28 10:07:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:07:54,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311919451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:54,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:54,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:07:54,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:54,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812395791] [2022-04-28 10:07:54,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812395791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:54,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:54,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:07:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909860366] [2022-04-28 10:07:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:54,650 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 29 [2022-04-28 10:07:54,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:54,650 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-28 10:07:54,665 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-28 10:07:54,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:07:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:07:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:07:54,665 INFO L87 Difference]: Start difference. First operand 187 states and 253 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-28 10:07:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:56,473 INFO L93 Difference]: Finished difference Result 254 states and 326 transitions. [2022-04-28 10:07:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:07:56,473 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 29 [2022-04-28 10:07:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:56,473 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-28 10:07:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-28 10:07:56,474 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-28 10:07:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-28 10:07:56,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-28 10:07:56,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:56,531 INFO L225 Difference]: With dead ends: 254 [2022-04-28 10:07:56,531 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 10:07:56,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:07:56,531 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:56,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 10:07:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 187. [2022-04-28 10:07:57,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:57,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:57,108 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:57,108 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:57,110 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-28 10:07:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-28 10:07:57,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:57,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:57,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 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 240 states. [2022-04-28 10:07:57,111 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 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 240 states. [2022-04-28 10:07:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:57,113 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-28 10:07:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-28 10:07:57,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:57,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:57,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:57,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2022-04-28 10:07:57,116 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 29 [2022-04-28 10:07:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:57,116 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2022-04-28 10:07:57,116 INFO L496 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-28 10:07:57,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 252 transitions. [2022-04-28 10:07:57,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2022-04-28 10:07:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:07:57,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:57,788 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:57,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:07:57,989 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:57,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 27 times [2022-04-28 10:07:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:57,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217311089] [2022-04-28 10:07:57,991 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:57,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 28 times [2022-04-28 10:07:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:57,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374100813] [2022-04-28 10:07:57,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {33637#(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); {33616#true} is VALID [2022-04-28 10:07:58,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-28 10:07:58,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-28 10:07:58,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:58,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {33637#(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); {33616#true} is VALID [2022-04-28 10:07:58,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-28 10:07:58,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-28 10:07:58,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-28 10:07:58,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33621#(= main_~y~0 0)} is VALID [2022-04-28 10:07:58,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {33621#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:58,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:58,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:58,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:58,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:58,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:58,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:58,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:58,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:58,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:58,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:58,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:58,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:58,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:58,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:58,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {33636#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:58,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {33636#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-28 10:07:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:58,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374100813] [2022-04-28 10:07:58,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374100813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:58,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892110485] [2022-04-28 10:07:58,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:58,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:58,226 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:58,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:07:58,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:58,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:58,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:07:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:58,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33616#true} is VALID [2022-04-28 10:07:58,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#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); {33616#true} is VALID [2022-04-28 10:07:58,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-28 10:07:58,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-28 10:07:58,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-28 10:07:58,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33621#(= main_~y~0 0)} is VALID [2022-04-28 10:07:58,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {33621#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:58,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:58,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:58,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:58,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:58,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:58,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:58,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:58,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:58,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:58,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:58,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:58,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:58,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:58,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {33704#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {33704#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-28 10:07:58,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-28 10:07:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:58,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:58,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {33744#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-28 10:07:58,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {33748#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {33744#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:58,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {33748#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33748#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:58,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {33755#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33748#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:58,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {33759#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33755#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:58,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {33763#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33759#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:58,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {33767#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33763#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:58,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {33771#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33767#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:58,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {33775#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33771#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:58,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {33779#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33775#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:58,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {33783#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33779#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:58,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {33787#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33783#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:58,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {33791#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33787#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:58,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {33795#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33791#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:58,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {33799#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33795#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:58,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {33803#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33799#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:58,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {33807#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33803#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:07:58,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33807#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:07:58,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-28 10:07:58,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-28 10:07:58,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-28 10:07:58,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#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); {33616#true} is VALID [2022-04-28 10:07:58,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33616#true} is VALID [2022-04-28 10:07:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:58,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892110485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:58,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:58,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:07:58,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217311089] [2022-04-28 10:07:58,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217311089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:58,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:58,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:07:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159241178] [2022-04-28 10:07:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:07:58,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:58,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:07:58,982 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-28 10:07:58,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:07:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:07:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:07:58,983 INFO L87 Difference]: Start difference. First operand 187 states and 252 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:08:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,157 INFO L93 Difference]: Finished difference Result 333 states and 501 transitions. [2022-04-28 10:08:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:08:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:08:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:08:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-28 10:08:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:08:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-28 10:08:03,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 163 transitions. [2022-04-28 10:08:03,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,280 INFO L225 Difference]: With dead ends: 333 [2022-04-28 10:08:03,280 INFO L226 Difference]: Without dead ends: 313 [2022-04-28 10:08:03,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:08:03,281 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 118 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:03,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 153 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:08:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-28 10:08:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200. [2022-04-28 10:08:03,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:03,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,883 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,883 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,887 INFO L93 Difference]: Finished difference Result 313 states and 399 transitions. [2022-04-28 10:08:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 399 transitions. [2022-04-28 10:08:03,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:03,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:03,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 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 313 states. [2022-04-28 10:08:03,887 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 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 313 states. [2022-04-28 10:08:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,891 INFO L93 Difference]: Finished difference Result 313 states and 399 transitions. [2022-04-28 10:08:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 399 transitions. [2022-04-28 10:08:03,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:03,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:03,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:03,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2022-04-28 10:08:03,893 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 29 [2022-04-28 10:08:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:03,894 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2022-04-28 10:08:03,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-28 10:08:03,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 271 transitions. [2022-04-28 10:08:07,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 270 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2022-04-28 10:08:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:07,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:07,390 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:07,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 10:08:07,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:08:07,590 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 17 times [2022-04-28 10:08:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:07,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317610539] [2022-04-28 10:08:07,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:07,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 18 times [2022-04-28 10:08:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802218338] [2022-04-28 10:08:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {35567#(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); {35552#true} is VALID [2022-04-28 10:08:07,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-28 10:08:07,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-28 10:08:07,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:07,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {35567#(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); {35552#true} is VALID [2022-04-28 10:08:07,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-28 10:08:07,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-28 10:08:07,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-28 10:08:07,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-28 10:08:07,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:07,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:08:07,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {35558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:07,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {35559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35560#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:07,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {35560#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:07,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:07,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:08:07,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 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; {35562#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:08:07,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {35562#(<= (+ (* (div (+ main_~x~0 4) 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; {35563#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:08:07,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {35563#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) 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; {35564#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:08:07,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {35564#(<= (+ 3 (* (div (+ main_~x~0 2) 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; {35565#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:08:07,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {35565#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(<= (+ 5 (* 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(<= (+ 5 (* 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {35566#(<= (+ 5 (* 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {35566#(<= (+ 5 (* 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {35566#(<= (+ 5 (* 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; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:08:07,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-28 10:08:07,730 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-28 10:08:07,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-28 10:08:07,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-28 10:08:07,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-28 10:08:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:07,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802218338] [2022-04-28 10:08:07,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802218338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:07,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094984255] [2022-04-28 10:08:07,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:07,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:07,732 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:07,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:08:07,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:08:07,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:07,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:08:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:08,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35552#true} is VALID [2022-04-28 10:08:08,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#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); {35552#true} is VALID [2022-04-28 10:08:08,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-28 10:08:08,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-28 10:08:08,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-28 10:08:08,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-28 10:08:08,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:08,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:08,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:08:08,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (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; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:08:08,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:08,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:08,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-28 10:08:08,056 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-28 10:08:08,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-28 10:08:08,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-28 10:08:08,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-28 10:08:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:08,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:08,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-28 10:08:08,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-28 10:08:08,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-28 10:08:08,166 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-28 10:08:08,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-28 10:08:08,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 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; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:08,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:08,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (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; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:08:08,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:08:08,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:08,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:08:08,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:08:08,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-28 10:08:08,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-28 10:08:08,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-28 10:08:08,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-28 10:08:08,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#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); {35552#true} is VALID [2022-04-28 10:08:08,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35552#true} is VALID [2022-04-28 10:08:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:08,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094984255] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:08,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:08,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:08:08,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:08,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317610539] [2022-04-28 10:08:08,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317610539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:08,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:08,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294101176] [2022-04-28 10:08:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:08:08,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:08,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:08,195 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-28 10:08:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:08:08,196 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:09,730 INFO L93 Difference]: Finished difference Result 242 states and 334 transitions. [2022-04-28 10:08:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:08:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:08:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-28 10:08:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-28 10:08:09,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2022-04-28 10:08:09,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:09,799 INFO L225 Difference]: With dead ends: 242 [2022-04-28 10:08:09,799 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 10:08:09,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:09,799 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:09,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 10:08:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2022-04-28 10:08:10,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:10,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:10,598 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:10,598 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:10,600 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-28 10:08:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-28 10:08:10,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:10,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:10,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 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 237 states. [2022-04-28 10:08:10,601 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 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 237 states. [2022-04-28 10:08:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:10,605 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-28 10:08:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-28 10:08:10,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:10,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:10,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:10,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 311 transitions. [2022-04-28 10:08:10,608 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 311 transitions. Word has length 30 [2022-04-28 10:08:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:10,608 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 311 transitions. [2022-04-28 10:08:10,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:10,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 311 transitions. [2022-04-28 10:08:11,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 311 transitions. [2022-04-28 10:08:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:08:11,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:11,743 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:11,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 10:08:11,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:08:11,943 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 29 times [2022-04-28 10:08:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:11,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [890506673] [2022-04-28 10:08:11,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:11,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 30 times [2022-04-28 10:08:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:11,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081206776] [2022-04-28 10:08:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {37208#(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); {37186#true} is VALID [2022-04-28 10:08:12,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-28 10:08:12,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-28 10:08:12,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#(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); {37186#true} is VALID [2022-04-28 10:08:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-28 10:08:12,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-28 10:08:12,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-28 10:08:12,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37191#(= main_~y~0 0)} is VALID [2022-04-28 10:08:12,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {37191#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:12,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:12,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:12,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:12,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:12,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:12,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:12,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:12,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:12,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:12,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:12,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:12,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:12,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:12,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:12,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {37207#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {37207#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-28 10:08:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081206776] [2022-04-28 10:08:12,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081206776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:12,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139053114] [2022-04-28 10:08:12,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:12,202 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:12,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:08:12,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:08:12,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:12,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:08:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:12,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37186#true} is VALID [2022-04-28 10:08:12,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#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); {37186#true} is VALID [2022-04-28 10:08:12,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-28 10:08:12,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-28 10:08:12,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-28 10:08:12,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37191#(= main_~y~0 0)} is VALID [2022-04-28 10:08:12,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {37191#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:12,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:12,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:12,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:12,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:12,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:12,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:12,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:12,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:12,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:12,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:12,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:12,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:12,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:12,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {37278#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {37278#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-28 10:08:12,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-28 10:08:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:12,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:13,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-28 10:08:13,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-28 10:08:13,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-28 10:08:13,164 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-28 10:08:13,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:13,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:13,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {37318#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-28 10:08:13,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {37322#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {37318#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:13,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {37322#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37322#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:13,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {37329#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37322#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:13,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {37333#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37329#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:13,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {37337#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37333#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:13,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {37341#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37337#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:13,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {37345#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37341#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:13,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {37349#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37345#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {37353#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37349#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:13,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {37357#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37353#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {37361#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37357#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:13,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {37365#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37361#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:13,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {37369#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37365#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:13,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {37373#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37369#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:08:13,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {37377#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37373#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:08:13,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {37381#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37377#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:08:13,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {37385#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37381#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:08:13,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37385#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:08:13,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-28 10:08:13,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-28 10:08:13,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-28 10:08:13,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#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); {37186#true} is VALID [2022-04-28 10:08:13,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37186#true} is VALID [2022-04-28 10:08:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:13,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139053114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:13,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:13,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:08:13,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:13,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [890506673] [2022-04-28 10:08:13,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [890506673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:13,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:13,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:08:13,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534050388] [2022-04-28 10:08:13,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:13,176 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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 30 [2022-04-28 10:08:13,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:13,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-28 10:08:13,194 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-28 10:08:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:08:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:08:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:08:13,195 INFO L87 Difference]: Start difference. First operand 228 states and 311 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-28 10:08:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:18,179 INFO L93 Difference]: Finished difference Result 405 states and 615 transitions. [2022-04-28 10:08:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:08:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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 30 [2022-04-28 10:08:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-28 10:08:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-28 10:08:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-28 10:08:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-28 10:08:18,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2022-04-28 10:08:18,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:18,316 INFO L225 Difference]: With dead ends: 405 [2022-04-28 10:08:18,317 INFO L226 Difference]: Without dead ends: 383 [2022-04-28 10:08:18,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:08:18,317 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 131 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:18,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:08:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-28 10:08:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 243. [2022-04-28 10:08:19,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:19,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,128 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,128 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,133 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-28 10:08:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-28 10:08:19,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:19,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:19,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 383 states. [2022-04-28 10:08:19,133 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 383 states. [2022-04-28 10:08:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:19,138 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-28 10:08:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-28 10:08:19,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:19,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:19,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:19,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-28 10:08:19,142 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 30 [2022-04-28 10:08:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:19,142 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-28 10:08:19,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-28 10:08:19,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-28 10:08:20,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-28 10:08:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:20,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:20,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:20,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:20,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 10:08:20,933 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 29 times [2022-04-28 10:08:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:20,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599070318] [2022-04-28 10:08:20,953 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:20,953 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 30 times [2022-04-28 10:08:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:20,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846305026] [2022-04-28 10:08:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {39521#(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); {39502#true} is VALID [2022-04-28 10:08:21,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-28 10:08:21,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-28 10:08:21,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:21,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {39521#(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); {39502#true} is VALID [2022-04-28 10:08:21,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-28 10:08:21,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-28 10:08:21,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-28 10:08:21,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:21,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39508#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:21,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {39508#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39509#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:08:21,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {39509#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39510#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:21,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {39510#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39511#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 10:08:21,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:08:21,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:08:21,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~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; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:21,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:21,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:21,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:21,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:21,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:08:21,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:21,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~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; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:21,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= 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; {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-28 10:08:21,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-28 10:08:21,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:21,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:21,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:08:21,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:08:21,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:08:21,360 INFO L272 TraceCheckUtils]: 27: Hoare triple {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:21,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {39519#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:21,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {39520#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39503#false} is VALID [2022-04-28 10:08:21,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-28 10:08:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:08:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846305026] [2022-04-28 10:08:21,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846305026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072543521] [2022-04-28 10:08:21,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:21,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:21,362 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:08:21,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:21,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:21,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:08:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:22,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39502#true} is VALID [2022-04-28 10:08:22,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#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); {39502#true} is VALID [2022-04-28 10:08:22,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-28 10:08:22,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-28 10:08:22,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-28 10:08:22,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:22,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39543#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:08:22,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {39543#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39547#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-28 10:08:22,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {39547#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39551#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:08:22,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {39551#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39555#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} is VALID [2022-04-28 10:08:22,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {39555#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:08:22,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:08:22,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~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; {39566#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4) (= (+ main_~n~0 (- 3)) main_~x~0))} is VALID [2022-04-28 10:08:22,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {39566#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4) (= (+ main_~n~0 (- 3)) 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; {39570#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 4))} is VALID [2022-04-28 10:08:22,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {39570#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~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; {39574#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= main_~y~0 4))} is VALID [2022-04-28 10:08:22,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {39574#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= main_~y~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; {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} is VALID [2022-04-28 10:08:22,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} is VALID [2022-04-28 10:08:22,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~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; {39585#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 4 (+ main_~y~0 1)))} is VALID [2022-04-28 10:08:22,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {39585#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 4 (+ 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; {39589#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-28 10:08:22,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {39589#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 3 (+ 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; {39593#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 2) 3))} is VALID [2022-04-28 10:08:22,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {39593#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 2) 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; {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} is VALID [2022-04-28 10:08:22,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} assume !(~y~0 % 4294967296 > 0); {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} is VALID [2022-04-28 10:08:22,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:22,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:22,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-28 10:08:22,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:22,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~x~0 % 4294967296 > 0); {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-28 10:08:22,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:22,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:22,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {39623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39503#false} is VALID [2022-04-28 10:08:22,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-28 10:08:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:22,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:23,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-28 10:08:23,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {39623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39503#false} is VALID [2022-04-28 10:08:23,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:23,181 INFO L272 TraceCheckUtils]: 27: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:23,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:23,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:23,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:23,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:23,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 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; {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:23,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 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; {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:23,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 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; {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:23,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod 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; {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:23,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {39639#(= (mod main_~n~0 4294967296) (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; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {39639#(= (mod main_~n~0 4294967296) (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; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {39639#(= (mod main_~n~0 4294967296) (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; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {39639#(= (mod main_~n~0 4294967296) (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; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {39695#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:23,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {39699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39695#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:23,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {39703#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:08:23,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {39707#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39703#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:08:23,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {39711#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39707#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:23,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39711#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:08:23,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-28 10:08:23,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-28 10:08:23,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-28 10:08:23,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#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); {39502#true} is VALID [2022-04-28 10:08:23,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39502#true} is VALID [2022-04-28 10:08:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:08:23,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072543521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:23,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:23,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 14] total 42 [2022-04-28 10:08:23,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:23,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599070318] [2022-04-28 10:08:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599070318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:23,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:23,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:08:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073532653] [2022-04-28 10:08:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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 31 [2022-04-28 10:08:23,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:23,195 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), 15 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-28 10:08:23,231 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-28 10:08:23,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:08:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:23,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:08:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:23,232 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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-28 10:08:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:25,271 INFO L93 Difference]: Finished difference Result 258 states and 348 transitions. [2022-04-28 10:08:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:08:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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 31 [2022-04-28 10:08:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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-28 10:08:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-28 10:08:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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-28 10:08:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-28 10:08:25,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 45 transitions. [2022-04-28 10:08:25,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:25,326 INFO L225 Difference]: With dead ends: 258 [2022-04-28 10:08:25,326 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 10:08:25,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=339, Invalid=2741, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:08:25,327 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:25,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 10:08:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-04-28 10:08:26,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:26,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,147 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,148 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,150 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-28 10:08:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-28 10:08:26,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 253 states. [2022-04-28 10:08:26,151 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 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 253 states. [2022-04-28 10:08:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:26,153 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-28 10:08:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-28 10:08:26,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:26,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:26,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:26,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-28 10:08:26,156 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 31 [2022-04-28 10:08:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:26,157 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-28 10:08:26,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 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-28 10:08:26,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-28 10:08:27,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-28 10:08:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:27,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:27,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:27,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 10:08:27,708 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 31 times [2022-04-28 10:08:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:27,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793798059] [2022-04-28 10:08:27,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:27,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 32 times [2022-04-28 10:08:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:27,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70168076] [2022-04-28 10:08:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:27,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:27,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {41283#(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); {41268#true} is VALID [2022-04-28 10:08:27,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-28 10:08:27,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-28 10:08:27,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:27,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {41283#(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); {41268#true} is VALID [2022-04-28 10:08:27,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-28 10:08:27,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-28 10:08:27,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-28 10:08:27,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41273#(= main_~y~0 0)} is VALID [2022-04-28 10:08:27,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {41273#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:27,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:27,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:27,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:27,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:27,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:27,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:27,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {41279#(and (<= main_~z~0 5) (<= 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; {41280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:27,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {41280#(and (<= 4 main_~z~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; {41281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:27,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {41281#(and (<= main_~z~0 3) (<= 3 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; {41282#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:27,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {41282#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-28 10:08:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:08:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70168076] [2022-04-28 10:08:27,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70168076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141700489] [2022-04-28 10:08:27,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:27,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:27,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:27,883 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:27,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:08:27,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:27,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:27,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:08:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:27,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:28,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41268#true} is VALID [2022-04-28 10:08:28,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#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); {41268#true} is VALID [2022-04-28 10:08:28,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-28 10:08:28,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-28 10:08:28,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-28 10:08:28,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41273#(= main_~y~0 0)} is VALID [2022-04-28 10:08:28,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {41273#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:28,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:28,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:28,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:28,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:28,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:28,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41323#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:28,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {41323#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 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; {41327#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:28,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {41327#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= 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; {41331#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {41331#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 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; {41335#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {41335#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-28 10:08:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:08:28,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-28 10:08:28,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-28 10:08:28,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#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; {41269#false} is VALID [2022-04-28 10:08:28,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {41411#(not (< 0 (mod 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; {41269#false} is VALID [2022-04-28 10:08:28,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {41415#(not (< 0 (mod (+ main_~y~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; {41411#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:28,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {41419#(not (< 0 (mod (+ main_~y~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; {41415#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:28,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {41423#(not (< 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; {41419#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:28,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {41427#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {41423#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:28,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {41431#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {41427#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:08:28,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {41435#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {41431#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:28,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {41439#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {41435#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {41268#true} ~z~0 := ~y~0; {41439#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {41268#true} assume !(~x~0 % 4294967296 > 0); {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#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); {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41268#true} is VALID [2022-04-28 10:08:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:08:28,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141700489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:28,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:28,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-28 10:08:28,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793798059] [2022-04-28 10:08:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793798059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:28,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:28,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622941780] [2022-04-28 10:08:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:28,310 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 31 [2022-04-28 10:08:28,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:28,310 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-28 10:08:28,325 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-28 10:08:28,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:08:28,325 INFO L87 Difference]: Start difference. First operand 243 states and 333 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-28 10:08:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:30,377 INFO L93 Difference]: Finished difference Result 297 states and 392 transitions. [2022-04-28 10:08:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:08:30,377 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 31 [2022-04-28 10:08:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:30,377 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-28 10:08:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-28 10:08:30,378 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-28 10:08:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-28 10:08:30,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 73 transitions. [2022-04-28 10:08:30,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:30,432 INFO L225 Difference]: With dead ends: 297 [2022-04-28 10:08:30,432 INFO L226 Difference]: Without dead ends: 282 [2022-04-28 10:08:30,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:08:30,433 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:30,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 72 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-28 10:08:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2022-04-28 10:08:31,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:31,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:31,258 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:31,258 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:31,261 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-04-28 10:08:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-04-28 10:08:31,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:31,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:31,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 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 282 states. [2022-04-28 10:08:31,262 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 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 282 states. [2022-04-28 10:08:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:31,265 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-04-28 10:08:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-04-28 10:08:31,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:31,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:31,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:31,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 332 transitions. [2022-04-28 10:08:31,268 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 332 transitions. Word has length 31 [2022-04-28 10:08:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:31,269 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 332 transitions. [2022-04-28 10:08:31,269 INFO L496 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-28 10:08:31,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 332 transitions. [2022-04-28 10:08:32,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 332 transitions. [2022-04-28 10:08:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:32,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:32,380 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:32,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:32,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 10:08:32,580 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 19 times [2022-04-28 10:08:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767650151] [2022-04-28 10:08:32,582 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:32,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 20 times [2022-04-28 10:08:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452528423] [2022-04-28 10:08:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {43168#(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); {43151#true} is VALID [2022-04-28 10:08:32,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-28 10:08:32,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-28 10:08:32,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:32,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {43168#(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); {43151#true} is VALID [2022-04-28 10:08:32,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-28 10:08:32,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-28 10:08:32,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-28 10:08:32,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43156#(= main_~y~0 0)} is VALID [2022-04-28 10:08:32,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {43156#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:32,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:32,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:32,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:32,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:32,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:32,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43162#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:32,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {43162#(and (<= main_~z~0 5) (<= 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; {43163#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:32,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {43163#(and (<= 4 main_~z~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; {43164#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:32,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {43164#(and (<= main_~z~0 3) (<= 3 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; {43165#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:32,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {43165#(and (<= main_~z~0 2) (<= 2 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; {43166#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:32,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {43166#(and (<= main_~z~0 1) (<= 1 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; {43167#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {43167#(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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {43152#false} assume !(~z~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {43152#false} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-28 10:08:32,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-28 10:08:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452528423] [2022-04-28 10:08:32,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452528423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080677860] [2022-04-28 10:08:32,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:32,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:32,748 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:32,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:08:32,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:32,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:32,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:08:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:32,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:33,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43151#true} is VALID [2022-04-28 10:08:33,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#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); {43151#true} is VALID [2022-04-28 10:08:33,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-28 10:08:33,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-28 10:08:33,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-28 10:08:33,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43156#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {43156#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:33,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:33,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:33,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43208#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {43208#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 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; {43212#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:33,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {43212#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= 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; {43216#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {43216#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 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; {43220#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {43220#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 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; {43224#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {43224#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 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; {43228#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {43228#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {43152#false} assume !(~z~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {43152#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; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {43152#false} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-28 10:08:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:33,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:33,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-28 10:08:33,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-28 10:08:33,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-28 10:08:33,363 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-28 10:08:33,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:33,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {43283#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-28 10:08:33,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {43287#(< 0 (mod (+ main_~y~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; {43283#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:33,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {43291#(< 0 (mod (+ main_~y~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; {43287#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:33,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {43295#(< 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; {43291#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:33,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {43299#(< 0 (mod (+ 4294967292 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; {43295#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:33,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {43303#(< 0 (mod (+ 4294967291 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; {43299#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:33,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:33,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {43310#(or (< 0 (mod (+ 4294967291 main_~y~0) 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; {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:33,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {43314#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 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; {43310#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:08:33,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {43318#(or (< 0 (mod (+ 4294967291 main_~y~0) 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; {43314#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:33,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {43322#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 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; {43318#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:33,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {43326#(or (< 0 (mod (+ 4294967291 main_~y~0) 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; {43322#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {43330#(or (< 0 (mod (+ 4294967291 main_~y~0) 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; {43326#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {43151#true} ~z~0 := ~y~0; {43330#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {43151#true} assume !(~x~0 % 4294967296 > 0); {43151#true} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-28 10:08:33,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#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); {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43151#true} is VALID [2022-04-28 10:08:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:08:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080677860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:33,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:33,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-28 10:08:33,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767650151] [2022-04-28 10:08:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767650151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:33,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:33,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:08:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404048] [2022-04-28 10:08:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:33,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 31 [2022-04-28 10:08:33,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:33,374 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-28 10:08:33,389 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-28 10:08:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:08:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:08:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:08:33,390 INFO L87 Difference]: Start difference. First operand 243 states and 332 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-28 10:08:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:35,952 INFO L93 Difference]: Finished difference Result 294 states and 387 transitions. [2022-04-28 10:08:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:08:35,952 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 31 [2022-04-28 10:08:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:35,952 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-28 10:08:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 10:08:35,953 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-28 10:08:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 10:08:35,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-28 10:08:36,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:36,018 INFO L225 Difference]: With dead ends: 294 [2022-04-28 10:08:36,018 INFO L226 Difference]: Without dead ends: 271 [2022-04-28 10:08:36,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=3600, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:08:36,019 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:36,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 79 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:08:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-28 10:08:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 242. [2022-04-28 10:08:36,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:36,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:36,881 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:36,881 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,884 INFO L93 Difference]: Finished difference Result 271 states and 361 transitions. [2022-04-28 10:08:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-04-28 10:08:36,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 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 271 states. [2022-04-28 10:08:36,888 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 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 271 states. [2022-04-28 10:08:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:36,891 INFO L93 Difference]: Finished difference Result 271 states and 361 transitions. [2022-04-28 10:08:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-04-28 10:08:36,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:36,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:36,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:36,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2022-04-28 10:08:36,894 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 31 [2022-04-28 10:08:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:36,894 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2022-04-28 10:08:36,894 INFO L496 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-28 10:08:36,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 328 transitions. [2022-04-28 10:08:38,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2022-04-28 10:08:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:38,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:38,037 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:38,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 10:08:38,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:38,240 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 33 times [2022-04-28 10:08:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193674424] [2022-04-28 10:08:38,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:38,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 34 times [2022-04-28 10:08:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:38,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509004141] [2022-04-28 10:08:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {45067#(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); {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:38,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {45067#(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); {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-28 10:08:38,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-28 10:08:38,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45057#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {45057#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:38,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:38,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:38,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:38,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:38,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:38,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:38,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {45064#(and (<= main_~z~0 6) (<= 6 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; {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {45065#(and (<= main_~z~0 5) (<= 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; {45066#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {45066#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-28 10:08:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:08:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:38,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509004141] [2022-04-28 10:08:38,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509004141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:38,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020984099] [2022-04-28 10:08:38,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:38,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:38,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:38,376 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:38,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:08:38,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:38,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:38,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:38,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:38,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45052#true} is VALID [2022-04-28 10:08:38,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#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); {45052#true} is VALID [2022-04-28 10:08:38,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-28 10:08:38,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-28 10:08:38,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-28 10:08:38,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45057#(= main_~y~0 0)} is VALID [2022-04-28 10:08:38,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {45057#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:38,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:38,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:38,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:38,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:38,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:38,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:38,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:38,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {45064#(and (<= main_~z~0 6) (<= 6 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; {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {45065#(and (<= main_~z~0 5) (<= 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; {45116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {45116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-28 10:08:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:08:38,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:38,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-28 10:08:38,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-28 10:08:38,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-28 10:08:38,817 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-28 10:08:38,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#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; {45053#false} is VALID [2022-04-28 10:08:38,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {45204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-28 10:08:38,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {45208#(< 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; {45204#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:38,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {45212#(< 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; {45208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:38,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {45212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:38,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:38,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {45223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:38,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {45227#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:38,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {45231#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45227#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:38,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {45235#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45231#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:38,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {45239#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45235#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:38,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {45243#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45239#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:38,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45243#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:38,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-28 10:08:38,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-28 10:08:38,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-28 10:08:38,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#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); {45052#true} is VALID [2022-04-28 10:08:38,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45052#true} is VALID [2022-04-28 10:08:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:08:38,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020984099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:38,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:38,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:08:38,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:38,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193674424] [2022-04-28 10:08:38,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193674424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:38,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:38,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713827261] [2022-04-28 10:08:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:38,825 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 31 [2022-04-28 10:08:38,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:38,825 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-28 10:08:38,840 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-28 10:08:38,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:08:38,840 INFO L87 Difference]: Start difference. First operand 242 states and 328 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-28 10:08:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:41,154 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2022-04-28 10:08:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:08:41,155 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 31 [2022-04-28 10:08:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:41,155 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-28 10:08:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-28 10:08:41,156 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-28 10:08:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-28 10:08:41,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-28 10:08:41,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:41,229 INFO L225 Difference]: With dead ends: 312 [2022-04-28 10:08:41,229 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 10:08:41,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:08:41,231 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:41,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 78 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 10:08:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 242. [2022-04-28 10:08:42,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:42,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:42,097 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:42,098 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,101 INFO L93 Difference]: Finished difference Result 297 states and 389 transitions. [2022-04-28 10:08:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2022-04-28 10:08:42,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:42,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:42,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 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 297 states. [2022-04-28 10:08:42,102 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 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 297 states. [2022-04-28 10:08:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,105 INFO L93 Difference]: Finished difference Result 297 states and 389 transitions. [2022-04-28 10:08:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2022-04-28 10:08:42,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:42,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:42,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:42,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 327 transitions. [2022-04-28 10:08:42,108 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 327 transitions. Word has length 31 [2022-04-28 10:08:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:42,108 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 327 transitions. [2022-04-28 10:08:42,108 INFO L496 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-28 10:08:42,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 327 transitions. [2022-04-28 10:08:43,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2022-04-28 10:08:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:43,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:43,179 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:43,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-28 10:08:43,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:43,379 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 35 times [2022-04-28 10:08:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300324722] [2022-04-28 10:08:43,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:43,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 36 times [2022-04-28 10:08:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:43,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866111733] [2022-04-28 10:08:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {47007#(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); {46992#true} is VALID [2022-04-28 10:08:43,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-28 10:08:43,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-28 10:08:43,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {47007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:43,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {47007#(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); {46992#true} is VALID [2022-04-28 10:08:43,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-28 10:08:43,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-28 10:08:43,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-28 10:08:43,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46997#(= main_~y~0 0)} is VALID [2022-04-28 10:08:43,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {46997#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:43,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:43,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:43,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:43,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:43,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:43,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:43,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:43,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {47005#(and (<= main_~z~0 7) (<= 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; {47006#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {47006#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-28 10:08:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:08:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866111733] [2022-04-28 10:08:43,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866111733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:43,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713976696] [2022-04-28 10:08:43,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:43,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:43,519 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:43,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:08:43,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:08:43,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:43,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:08:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:43,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:43,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {46992#true} is VALID [2022-04-28 10:08:43,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#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); {46992#true} is VALID [2022-04-28 10:08:43,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-28 10:08:43,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-28 10:08:43,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-28 10:08:43,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46997#(= main_~y~0 0)} is VALID [2022-04-28 10:08:43,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {46997#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:43,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:43,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:43,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:43,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:43,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:43,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:43,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:43,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {47005#(and (<= main_~z~0 7) (<= 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; {47056#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {47056#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-28 10:08:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:08:43,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:44,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-28 10:08:44,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-28 10:08:44,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#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; {46993#false} is VALID [2022-04-28 10:08:44,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {47144#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-28 10:08:44,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {47148#(< 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; {47144#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:44,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {47148#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {47159#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:44,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {47163#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47159#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:44,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {47167#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47163#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:44,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {47171#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47167#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:44,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {47175#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47171#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:44,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {47179#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47175#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:44,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {47183#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47179#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:44,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47183#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:44,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-28 10:08:44,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-28 10:08:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-28 10:08:44,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#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); {46992#true} is VALID [2022-04-28 10:08:44,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {46992#true} is VALID [2022-04-28 10:08:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:08:44,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713976696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:44,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:44,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:08:44,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:44,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300324722] [2022-04-28 10:08:44,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300324722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:44,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:44,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:08:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948684241] [2022-04-28 10:08:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:44,061 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 31 [2022-04-28 10:08:44,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:44,061 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-28 10:08:44,076 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-28 10:08:44,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:08:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:08:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:08:44,077 INFO L87 Difference]: Start difference. First operand 242 states and 327 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-28 10:08:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:46,596 INFO L93 Difference]: Finished difference Result 329 states and 421 transitions. [2022-04-28 10:08:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:08:46,596 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 31 [2022-04-28 10:08:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:46,596 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-28 10:08:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-28 10:08:46,597 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-28 10:08:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-28 10:08:46,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 87 transitions. [2022-04-28 10:08:46,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:46,662 INFO L225 Difference]: With dead ends: 329 [2022-04-28 10:08:46,662 INFO L226 Difference]: Without dead ends: 314 [2022-04-28 10:08:46,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:08:46,663 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:46,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 84 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-04-28 10:08:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2022-04-28 10:08:47,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:47,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,501 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,502 INFO L87 Difference]: Start difference. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,505 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2022-04-28 10:08:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2022-04-28 10:08:47,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 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 314 states. [2022-04-28 10:08:47,506 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 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 314 states. [2022-04-28 10:08:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,509 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2022-04-28 10:08:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2022-04-28 10:08:47,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:47,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2022-04-28 10:08:47,512 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 31 [2022-04-28 10:08:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:47,512 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2022-04-28 10:08:47,512 INFO L496 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-28 10:08:47,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 326 transitions. [2022-04-28 10:08:48,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2022-04-28 10:08:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:08:48,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:48,496 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:48,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:48,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:08:48,700 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 31 times [2022-04-28 10:08:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:48,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10820994] [2022-04-28 10:08:48,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:48,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 32 times [2022-04-28 10:08:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:48,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927472460] [2022-04-28 10:08:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:48,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {49019#(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); {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {49019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:48,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {49019#(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); {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-28 10:08:48,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-28 10:08:48,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49001#(= main_~y~0 0)} is VALID [2022-04-28 10:08:48,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {49001#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:48,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:48,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:48,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:48,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:48,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:48,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:48,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:48,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:48,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:48,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:48,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:48,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:48,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:48,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:48,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:48,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:48,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49018#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:48,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {49018#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:48,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:48,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:48,963 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-28 10:08:48,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-28 10:08:48,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-28 10:08:48,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-28 10:08:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:48,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927472460] [2022-04-28 10:08:48,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927472460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:48,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986436700] [2022-04-28 10:08:48,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:48,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:48,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:48,965 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:08:48,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:48,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:08:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:49,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:49,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {48996#true} is VALID [2022-04-28 10:08:49,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#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); {48996#true} is VALID [2022-04-28 10:08:49,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-28 10:08:49,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-28 10:08:49,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-28 10:08:49,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49001#(= main_~y~0 0)} is VALID [2022-04-28 10:08:49,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {49001#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:49,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:49,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:49,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:49,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:49,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:49,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:49,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:49,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:49,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:49,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:49,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:49,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:49,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:49,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:49,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:49,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:49,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49092#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {49092#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-28 10:08:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:49,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:49,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-28 10:08:49,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-28 10:08:49,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-28 10:08:49,748 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-28 10:08:49,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {49132#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-28 10:08:49,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {49136#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {49132#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:49,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {49136#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {49136#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:49,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {49143#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49136#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:49,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {49147#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49143#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:49,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {49151#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49147#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:49,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {49155#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49151#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:49,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {49159#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49155#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:49,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {49163#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49159#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:49,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {49167#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49163#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:49,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {49171#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49167#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:49,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {49175#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49171#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:49,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {49179#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49175#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:49,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {49183#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49179#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:49,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {49187#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49183#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:08:49,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {49191#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49187#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:08:49,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {49195#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49191#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:08:49,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {49199#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49195#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:08:49,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {49203#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49199#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:08:49,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49203#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:08:49,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-28 10:08:49,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-28 10:08:49,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-28 10:08:49,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#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); {48996#true} is VALID [2022-04-28 10:08:49,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {48996#true} is VALID [2022-04-28 10:08:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986436700] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:49,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:49,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:08:49,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:49,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10820994] [2022-04-28 10:08:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10820994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:08:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454371882] [2022-04-28 10:08:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:49,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:49,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:49,778 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-28 10:08:49,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:08:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:08:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:08:49,779 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:55,382 INFO L93 Difference]: Finished difference Result 427 states and 645 transitions. [2022-04-28 10:08:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:08:55,382 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2022-04-28 10:08:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2022-04-28 10:08:55,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 183 transitions. [2022-04-28 10:08:55,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:55,521 INFO L225 Difference]: With dead ends: 427 [2022-04-28 10:08:55,521 INFO L226 Difference]: Without dead ends: 405 [2022-04-28 10:08:55,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:08:55,522 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 136 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:55,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 173 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:08:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-28 10:08:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 257. [2022-04-28 10:08:56,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:56,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:56,411 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:56,411 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,417 INFO L93 Difference]: Finished difference Result 405 states and 513 transitions. [2022-04-28 10:08:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 513 transitions. [2022-04-28 10:08:56,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 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 405 states. [2022-04-28 10:08:56,418 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 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 405 states. [2022-04-28 10:08:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:56,423 INFO L93 Difference]: Finished difference Result 405 states and 513 transitions. [2022-04-28 10:08:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 513 transitions. [2022-04-28 10:08:56,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:56,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:56,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:56,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-28 10:08:56,427 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 31 [2022-04-28 10:08:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:56,427 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-28 10:08:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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-28 10:08:56,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-28 10:08:57,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-28 10:08:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:08:57,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:57,579 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:57,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:57,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 10:08:57,780 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 37 times [2022-04-28 10:08:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:57,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995855262] [2022-04-28 10:08:57,782 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:57,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 38 times [2022-04-28 10:08:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:57,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686640690] [2022-04-28 10:08:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {51448#(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); {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {51448#(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); {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:57,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:57,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:57,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:57,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:57,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:57,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= 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; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:57,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= 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; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= 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; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:57,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:57,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:57,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-28 10:08:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:08:57,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:57,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686640690] [2022-04-28 10:08:57,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686640690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:57,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474211185] [2022-04-28 10:08:57,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:57,898 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:57,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 10:08:57,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:57,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:57,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:08:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:57,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:58,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#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); {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= 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; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:58,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= 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; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= 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; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:58,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-28 10:08:58,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-28 10:08:58,164 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-28 10:08:58,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-28 10:08:58,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-28 10:08:58,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-28 10:08:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:08:58,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:58,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-28 10:08:58,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-28 10:08:58,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-28 10:08:58,385 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-28 10:08:58,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-28 10:08:58,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-28 10:08:58,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:58,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= 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; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= 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; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= 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; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:58,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= 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; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:58,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#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); {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51438#true} is VALID [2022-04-28 10:08:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:08:58,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474211185] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:58,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:58,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-28 10:08:58,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995855262] [2022-04-28 10:08:58,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995855262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:58,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:58,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:08:58,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135211734] [2022-04-28 10:08:58,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:08:58,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:58,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:58,413 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-28 10:08:58,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:08:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:08:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:08:58,414 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,946 INFO L93 Difference]: Finished difference Result 278 states and 370 transitions. [2022-04-28 10:08:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:08:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:08:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 10:08:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 10:08:59,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-28 10:08:59,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:59,999 INFO L225 Difference]: With dead ends: 278 [2022-04-28 10:08:59,999 INFO L226 Difference]: Without dead ends: 256 [2022-04-28 10:08:59,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:00,000 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 55 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-28 10:09:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2022-04-28 10:09:00,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,924 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,925 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,927 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-28 10:09:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-28 10:09:00,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 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 256 states. [2022-04-28 10:09:00,928 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 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 256 states. [2022-04-28 10:09:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,930 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-28 10:09:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-28 10:09:00,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-04-28 10:09:00,934 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 32 [2022-04-28 10:09:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,934 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-04-28 10:09:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 342 transitions. [2022-04-28 10:09:02,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-04-28 10:09:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:09:02,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:02,464 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:02,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 10:09:02,664 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 33 times [2022-04-28 10:09:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398621916] [2022-04-28 10:09:02,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 34 times [2022-04-28 10:09:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719675009] [2022-04-28 10:09:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {53246#(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); {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:02,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {53246#(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); {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-28 10:09:02,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-28 10:09:02,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53227#(= main_~y~0 0)} is VALID [2022-04-28 10:09:02,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {53227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:02,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:02,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:02,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:02,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:02,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:02,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:02,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:02,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:02,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:02,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:02,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:02,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:02,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:02,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:02,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:02,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:02,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {53245#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {53245#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-28 10:09:02,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-28 10:09:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719675009] [2022-04-28 10:09:02,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719675009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:02,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514161674] [2022-04-28 10:09:02,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:02,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:02,962 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:02,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 10:09:03,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:03,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:03,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53222#true} is VALID [2022-04-28 10:09:03,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#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); {53222#true} is VALID [2022-04-28 10:09:03,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-28 10:09:03,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-28 10:09:03,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-28 10:09:03,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53227#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {53227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:03,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:03,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:03,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:03,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:03,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:03,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:03,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:03,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:03,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:03,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:03,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:03,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:03,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:03,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:03,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {53322#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {53322#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-28 10:09:03,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-28 10:09:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:03,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:03,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-28 10:09:03,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {53362#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {53366#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {53362#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:03,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {53366#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53366#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:03,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {53373#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53366#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:03,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {53377#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53373#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:03,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {53381#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53377#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:03,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {53385#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53381#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:03,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {53389#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53385#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:03,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {53393#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53389#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:03,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {53397#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53393#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:03,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {53401#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53397#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:03,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {53405#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53401#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:03,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {53409#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53405#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:03,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {53413#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53409#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:03,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {53417#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53413#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:03,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {53421#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53417#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:03,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {53425#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53421#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:03,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {53429#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53425#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:03,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {53433#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53429#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:09:03,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {53437#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53433#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:09:03,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53437#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:09:03,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-28 10:09:03,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-28 10:09:03,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-28 10:09:03,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#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); {53222#true} is VALID [2022-04-28 10:09:03,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53222#true} is VALID [2022-04-28 10:09:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:03,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514161674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:03,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:03,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:09:03,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:03,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398621916] [2022-04-28 10:09:03,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398621916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:03,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:03,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:09:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989516555] [2022-04-28 10:09:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:03,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:03,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:03,945 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-28 10:09:03,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:09:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:09:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:09:03,946 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,222 INFO L93 Difference]: Finished difference Result 447 states and 678 transitions. [2022-04-28 10:09:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:09:10,222 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 189 transitions. [2022-04-28 10:09:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 189 transitions. [2022-04-28 10:09:10,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 189 transitions. [2022-04-28 10:09:10,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:10,367 INFO L225 Difference]: With dead ends: 447 [2022-04-28 10:09:10,367 INFO L226 Difference]: Without dead ends: 424 [2022-04-28 10:09:10,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:09:10,368 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:10,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 180 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 10:09:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-04-28 10:09:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 267. [2022-04-28 10:09:11,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:11,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,333 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,333 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,339 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2022-04-28 10:09:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 539 transitions. [2022-04-28 10:09:11,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 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 424 states. [2022-04-28 10:09:11,340 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 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 424 states. [2022-04-28 10:09:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:11,346 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2022-04-28 10:09:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 539 transitions. [2022-04-28 10:09:11,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:11,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:11,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:11,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 364 transitions. [2022-04-28 10:09:11,350 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 364 transitions. Word has length 32 [2022-04-28 10:09:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:11,350 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 364 transitions. [2022-04-28 10:09:11,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 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-28 10:09:11,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 364 transitions. [2022-04-28 10:09:12,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 364 transitions. [2022-04-28 10:09:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:09:12,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:12,464 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:12,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:12,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:12,682 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 39 times [2022-04-28 10:09:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [471424307] [2022-04-28 10:09:12,684 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:12,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 40 times [2022-04-28 10:09:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:12,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052120147] [2022-04-28 10:09:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {55788#(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); {55772#true} is VALID [2022-04-28 10:09:12,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-28 10:09:12,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-28 10:09:12,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:12,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {55788#(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); {55772#true} is VALID [2022-04-28 10:09:12,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-28 10:09:12,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-28 10:09:12,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-28 10:09:12,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55777#(= main_~y~0 0)} is VALID [2022-04-28 10:09:12,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {55777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:12,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:12,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:12,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:12,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:12,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:12,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:12,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {55784#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:12,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {55784#(and (<= main_~z~0 6) (<= 6 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; {55785#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:12,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {55785#(and (<= main_~z~0 5) (<= 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; {55786#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:12,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {55786#(and (<= 4 main_~z~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; {55787#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {55787#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-28 10:09:12,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-28 10:09:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:09:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052120147] [2022-04-28 10:09:12,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052120147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651994414] [2022-04-28 10:09:12,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:12,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:12,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:12,832 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:12,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 10:09:12,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:12,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:12,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:09:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:13,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55772#true} is VALID [2022-04-28 10:09:13,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#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); {55772#true} is VALID [2022-04-28 10:09:13,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-28 10:09:13,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-28 10:09:13,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-28 10:09:13,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55777#(= main_~y~0 0)} is VALID [2022-04-28 10:09:13,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {55777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:13,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:13,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:13,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:13,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:13,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:13,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:13,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {55831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:13,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {55831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 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; {55835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:13,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {55835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= 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; {55839#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {55839#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 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; {55843#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {55843#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-28 10:09:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:09:13,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:13,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-28 10:09:13,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-28 10:09:13,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-28 10:09:13,279 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-28 10:09:13,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:13,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#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; {55773#false} is VALID [2022-04-28 10:09:13,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {55925#(not (< 0 (mod 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; {55773#false} is VALID [2022-04-28 10:09:13,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {55929#(not (< 0 (mod (+ main_~y~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; {55925#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:13,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {55933#(not (< 0 (mod (+ main_~y~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; {55929#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:13,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {55937#(not (< 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; {55933#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:13,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {55941#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {55937#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:13,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {55945#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {55941#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:13,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {55949#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {55945#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {55953#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {55949#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {55772#true} ~z~0 := ~y~0; {55953#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {55772#true} assume !(~x~0 % 4294967296 > 0); {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55772#true} is VALID [2022-04-28 10:09:13,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-28 10:09:13,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-28 10:09:13,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-28 10:09:13,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#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); {55772#true} is VALID [2022-04-28 10:09:13,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55772#true} is VALID [2022-04-28 10:09:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:09:13,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651994414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:13,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:13,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-28 10:09:13,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:13,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [471424307] [2022-04-28 10:09:13,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [471424307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:13,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:13,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582744686] [2022-04-28 10:09:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:13,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:13,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:13,302 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-28 10:09:13,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:13,302 INFO L87 Difference]: Start difference. First operand 267 states and 364 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:15,747 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2022-04-28 10:09:15,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:15,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-28 10:09:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-28 10:09:15,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2022-04-28 10:09:15,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:15,806 INFO L225 Difference]: With dead ends: 328 [2022-04-28 10:09:15,806 INFO L226 Difference]: Without dead ends: 312 [2022-04-28 10:09:15,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:15,806 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:15,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 76 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-28 10:09:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 267. [2022-04-28 10:09:16,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,771 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,771 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,775 INFO L93 Difference]: Finished difference Result 312 states and 415 transitions. [2022-04-28 10:09:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2022-04-28 10:09:16,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 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 312 states. [2022-04-28 10:09:16,775 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 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 312 states. [2022-04-28 10:09:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,779 INFO L93 Difference]: Finished difference Result 312 states and 415 transitions. [2022-04-28 10:09:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2022-04-28 10:09:16,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2022-04-28 10:09:16,782 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 33 [2022-04-28 10:09:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,782 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2022-04-28 10:09:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:16,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 363 transitions. [2022-04-28 10:09:19,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2022-04-28 10:09:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:09:19,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:19,122 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:19,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 10:09:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 10:09:19,322 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 21 times [2022-04-28 10:09:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:19,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940602053] [2022-04-28 10:09:19,325 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:19,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 22 times [2022-04-28 10:09:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:19,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054145946] [2022-04-28 10:09:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {57857#(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); {57840#true} is VALID [2022-04-28 10:09:19,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-28 10:09:19,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:19,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {57857#(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); {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-28 10:09:19,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57846#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:19,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {57846#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57847#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {57847#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57848#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {57848#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57849#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {57849#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:19,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:19,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:19,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 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; {57851#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:19,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {57851#(<= (+ (* (div (+ 5 main_~x~0) 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; {57852#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:09:19,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {57852#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) 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; {57853#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:09:19,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {57853#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) 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; {57854#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:09:19,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {57854#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) 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; {57855#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:19,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {57855#(<= (+ 5 (* (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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {57856#(<= (+ 6 (* 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; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:19,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-28 10:09:19,499 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-28 10:09:19,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-28 10:09:19,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-28 10:09:19,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-28 10:09:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054145946] [2022-04-28 10:09:19,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054145946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581209781] [2022-04-28 10:09:19,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:19,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:19,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:19,501 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:19,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 10:09:19,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:19,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:19,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:09:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:19,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57840#true} is VALID [2022-04-28 10:09:19,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#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); {57840#true} is VALID [2022-04-28 10:09:19,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-28 10:09:19,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-28 10:09:19,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-28 10:09:19,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-28 10:09:19,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:19,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:19,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:19,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:19,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:19,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (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; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:19,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:19,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:19,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:19,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-28 10:09:19,892 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-28 10:09:19,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-28 10:09:19,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-28 10:09:19,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-28 10:09:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:19,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:20,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-28 10:09:20,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-28 10:09:20,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-28 10:09:20,017 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-28 10:09:20,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-28 10:09:20,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 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; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:20,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:20,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (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; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:20,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:20,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:20,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:09:20,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:09:20,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:20,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:20,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:20,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#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); {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57840#true} is VALID [2022-04-28 10:09:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:20,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581209781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:20,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:20,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:09:20,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:20,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940602053] [2022-04-28 10:09:20,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940602053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:20,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:20,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:09:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130686599] [2022-04-28 10:09:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 33 [2022-04-28 10:09:20,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:20,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-28 10:09:20,058 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-28 10:09:20,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:09:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:09:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:20,059 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-28 10:09:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,286 INFO L93 Difference]: Finished difference Result 316 states and 437 transitions. [2022-04-28 10:09:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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 33 [2022-04-28 10:09:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-28 10:09:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:09:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-28 10:09:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-28 10:09:24,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2022-04-28 10:09:24,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:24,378 INFO L225 Difference]: With dead ends: 316 [2022-04-28 10:09:24,378 INFO L226 Difference]: Without dead ends: 311 [2022-04-28 10:09:24,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:09:24,379 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:24,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 65 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-28 10:09:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2022-04-28 10:09:25,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:25,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,521 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,521 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,525 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-28 10:09:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-28 10:09:25,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 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 311 states. [2022-04-28 10:09:25,525 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 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 311 states. [2022-04-28 10:09:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,528 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-28 10:09:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-28 10:09:25,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:25,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 410 transitions. [2022-04-28 10:09:25,533 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 410 transitions. Word has length 33 [2022-04-28 10:09:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:25,533 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 410 transitions. [2022-04-28 10:09:25,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 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-28 10:09:25,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 410 transitions. [2022-04-28 10:09:27,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 410 transitions. [2022-04-28 10:09:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:09:27,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:27,222 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:27,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:27,422 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 41 times [2022-04-28 10:09:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447970383] [2022-04-28 10:09:27,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:27,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 42 times [2022-04-28 10:09:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:27,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394544093] [2022-04-28 10:09:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {59955#(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); {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:27,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {59955#(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); {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-28 10:09:27,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59944#(= main_~y~0 0)} is VALID [2022-04-28 10:09:27,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {59944#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:27,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:27,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:27,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:27,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:27,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:27,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:27,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {59952#(and (<= main_~z~0 7) (<= 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; {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:27,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {59953#(and (<= main_~z~0 6) (<= 6 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; {59954#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:27,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {59954#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-28 10:09:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:09:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:27,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394544093] [2022-04-28 10:09:27,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394544093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:27,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602898581] [2022-04-28 10:09:27,568 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:27,569 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:27,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 10:09:27,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:09:27,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:27,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:09:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:27,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:27,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59939#true} is VALID [2022-04-28 10:09:27,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#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); {59939#true} is VALID [2022-04-28 10:09:27,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-28 10:09:27,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-28 10:09:27,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-28 10:09:27,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59944#(= main_~y~0 0)} is VALID [2022-04-28 10:09:27,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {59944#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:27,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:27,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:27,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:27,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:27,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:27,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:27,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:27,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {59952#(and (<= main_~z~0 7) (<= 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; {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:27,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {59953#(and (<= main_~z~0 6) (<= 6 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; {60007#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {60007#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-28 10:09:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:09:27,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:28,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-28 10:09:28,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#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; {59940#false} is VALID [2022-04-28 10:09:28,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {60101#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-28 10:09:28,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {60105#(< 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; {60101#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:28,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {60109#(< 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; {60105#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:28,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {60109#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:28,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:28,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {60120#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:28,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {60124#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60120#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:28,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {60128#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60124#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:28,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {60132#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60128#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:28,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {60136#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60132#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:28,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {60140#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60136#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:28,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {60144#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60140#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:28,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60144#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:28,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-28 10:09:28,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-28 10:09:28,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-28 10:09:28,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#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); {59939#true} is VALID [2022-04-28 10:09:28,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59939#true} is VALID [2022-04-28 10:09:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:09:28,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602898581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:28,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:28,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:09:28,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:28,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447970383] [2022-04-28 10:09:28,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447970383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:28,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:28,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475486952] [2022-04-28 10:09:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:28,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:28,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:28,150 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-28 10:09:28,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:28,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:28,150 INFO L87 Difference]: Start difference. First operand 300 states and 410 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,221 INFO L93 Difference]: Finished difference Result 392 states and 509 transitions. [2022-04-28 10:09:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:31,221 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-28 10:09:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-28 10:09:31,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2022-04-28 10:09:31,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,288 INFO L225 Difference]: With dead ends: 392 [2022-04-28 10:09:31,288 INFO L226 Difference]: Without dead ends: 376 [2022-04-28 10:09:31,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:31,288 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:31,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 82 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-28 10:09:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 300. [2022-04-28 10:09:32,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:32,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,489 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,489 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,493 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2022-04-28 10:09:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 493 transitions. [2022-04-28 10:09:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 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 376 states. [2022-04-28 10:09:32,494 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 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 376 states. [2022-04-28 10:09:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:32,498 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2022-04-28 10:09:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 493 transitions. [2022-04-28 10:09:32,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:32,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:32,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:32,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2022-04-28 10:09:32,503 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 33 [2022-04-28 10:09:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:32,503 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2022-04-28 10:09:32,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:32,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 409 transitions. [2022-04-28 10:09:34,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2022-04-28 10:09:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:09:34,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:34,204 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:34,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:34,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 10:09:34,404 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 43 times [2022-04-28 10:09:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:34,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990096288] [2022-04-28 10:09:34,406 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:34,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 44 times [2022-04-28 10:09:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:34,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540144531] [2022-04-28 10:09:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {62345#(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); {62329#true} is VALID [2022-04-28 10:09:34,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-28 10:09:34,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-28 10:09:34,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:34,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {62345#(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); {62329#true} is VALID [2022-04-28 10:09:34,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-28 10:09:34,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-28 10:09:34,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-28 10:09:34,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62334#(= main_~y~0 0)} is VALID [2022-04-28 10:09:34,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {62334#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:34,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:34,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:34,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:34,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:34,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:34,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:34,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:34,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:34,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:34,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62344#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:34,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {62344#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-28 10:09:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:09:34,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:34,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540144531] [2022-04-28 10:09:34,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540144531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:34,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477270606] [2022-04-28 10:09:34,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:34,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:34,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:34,569 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:34,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 10:09:34,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:34,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:34,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:09:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:34,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62329#true} is VALID [2022-04-28 10:09:34,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#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); {62329#true} is VALID [2022-04-28 10:09:34,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-28 10:09:34,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-28 10:09:34,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-28 10:09:34,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62334#(= main_~y~0 0)} is VALID [2022-04-28 10:09:34,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {62334#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:34,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:34,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:34,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:34,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:34,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:34,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:34,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:34,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:34,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62397#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {62397#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-28 10:09:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:09:34,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:35,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-28 10:09:35,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-28 10:09:35,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-28 10:09:35,086 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#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; {62330#false} is VALID [2022-04-28 10:09:35,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {62491#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-28 10:09:35,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {62495#(< 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; {62491#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:35,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {62495#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:35,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:35,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {62506#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:35,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {62510#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62506#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:35,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {62514#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62510#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:35,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {62518#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62514#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:35,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {62522#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62518#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:35,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {62526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62522#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:35,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {62530#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:35,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {62534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62530#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:35,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:35,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-28 10:09:35,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-28 10:09:35,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-28 10:09:35,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#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); {62329#true} is VALID [2022-04-28 10:09:35,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62329#true} is VALID [2022-04-28 10:09:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:09:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477270606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:35,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:35,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:09:35,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990096288] [2022-04-28 10:09:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990096288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:35,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738643833] [2022-04-28 10:09:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:35,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:35,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:35,110 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-28 10:09:35,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:35,111 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,467 INFO L93 Difference]: Finished difference Result 411 states and 528 transitions. [2022-04-28 10:09:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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-28 10:09:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-28 10:09:38,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-28 10:09:38,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,543 INFO L225 Difference]: With dead ends: 411 [2022-04-28 10:09:38,543 INFO L226 Difference]: Without dead ends: 395 [2022-04-28 10:09:38,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:09:38,547 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:38,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 91 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-28 10:09:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 300. [2022-04-28 10:09:39,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:39,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,696 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,697 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,702 INFO L93 Difference]: Finished difference Result 395 states and 512 transitions. [2022-04-28 10:09:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 512 transitions. [2022-04-28 10:09:39,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:09:39,702 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:09:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,708 INFO L93 Difference]: Finished difference Result 395 states and 512 transitions. [2022-04-28 10:09:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 512 transitions. [2022-04-28 10:09:39,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:39,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2022-04-28 10:09:39,712 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 33 [2022-04-28 10:09:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:39,712 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2022-04-28 10:09:39,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:39,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 408 transitions. [2022-04-28 10:09:41,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2022-04-28 10:09:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:09:41,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:41,352 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:41,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:41,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-28 10:09:41,553 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 35 times [2022-04-28 10:09:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:41,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926600449] [2022-04-28 10:09:41,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:41,555 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 36 times [2022-04-28 10:09:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978753938] [2022-04-28 10:09:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:41,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {64816#(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); {64791#true} is VALID [2022-04-28 10:09:41,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-28 10:09:41,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-28 10:09:41,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:41,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {64816#(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); {64791#true} is VALID [2022-04-28 10:09:41,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-28 10:09:41,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-28 10:09:41,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-28 10:09:41,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64796#(= main_~y~0 0)} is VALID [2022-04-28 10:09:41,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {64796#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:41,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:41,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:41,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:41,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:41,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:41,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:41,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:41,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:41,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:41,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:41,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:41,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:41,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:41,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:41,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:41,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:41,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:41,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:41,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {64815#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {64815#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-28 10:09:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978753938] [2022-04-28 10:09:41,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978753938] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700738859] [2022-04-28 10:09:41,863 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:41,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:41,864 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:41,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 10:09:42,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:09:42,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:42,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:42,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64791#true} is VALID [2022-04-28 10:09:42,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#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); {64791#true} is VALID [2022-04-28 10:09:42,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-28 10:09:42,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-28 10:09:42,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-28 10:09:42,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64796#(= main_~y~0 0)} is VALID [2022-04-28 10:09:42,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {64796#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:42,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:42,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:42,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:42,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:42,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:42,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:42,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:42,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:42,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:42,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:42,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:42,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:42,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:42,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:42,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:42,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:42,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:42,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {64895#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:09:42,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {64895#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-28 10:09:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:42,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:42,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-28 10:09:42,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-28 10:09:42,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-28 10:09:42,983 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-28 10:09:42,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {64935#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-28 10:09:42,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {64939#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {64935#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:42,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {64939#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {64939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:42,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {64946#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:42,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {64950#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64946#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:42,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {64954#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64950#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:42,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {64958#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64954#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:42,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64958#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:42,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {64966#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:42,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {64970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64966#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:42,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {64974#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:42,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {64978#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64974#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:42,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {64982#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64978#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:42,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {64986#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64982#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:42,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {64990#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64986#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:42,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {64994#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64990#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:42,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {64998#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64994#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:42,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {65002#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64998#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:42,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {65006#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65002#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:09:42,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {65010#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65006#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:09:42,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {65014#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65010#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:09:42,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65014#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:09:42,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-28 10:09:42,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-28 10:09:42,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-28 10:09:42,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#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); {64791#true} is VALID [2022-04-28 10:09:42,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64791#true} is VALID [2022-04-28 10:09:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:42,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700738859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:42,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:42,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:42,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926600449] [2022-04-28 10:09:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926600449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:42,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:42,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020212451] [2022-04-28 10:09:42,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:09:42,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:42,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:43,017 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-28 10:09:43,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:43,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:43,017 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,261 INFO L93 Difference]: Finished difference Result 531 states and 808 transitions. [2022-04-28 10:09:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:09:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:09:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 199 transitions. [2022-04-28 10:09:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 199 transitions. [2022-04-28 10:09:50,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 199 transitions. [2022-04-28 10:09:50,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:50,421 INFO L225 Difference]: With dead ends: 531 [2022-04-28 10:09:50,421 INFO L226 Difference]: Without dead ends: 506 [2022-04-28 10:09:50,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:09:50,421 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 146 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:50,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 190 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:09:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-04-28 10:09:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 317. [2022-04-28 10:09:51,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:51,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:51,622 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:51,622 INFO L87 Difference]: Start difference. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:51,629 INFO L93 Difference]: Finished difference Result 506 states and 641 transitions. [2022-04-28 10:09:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 641 transitions. [2022-04-28 10:09:51,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:51,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:51,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 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 506 states. [2022-04-28 10:09:51,630 INFO L87 Difference]: Start difference. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 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 506 states. [2022-04-28 10:09:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:51,638 INFO L93 Difference]: Finished difference Result 506 states and 641 transitions. [2022-04-28 10:09:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 641 transitions. [2022-04-28 10:09:51,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:51,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:51,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:51,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 433 transitions. [2022-04-28 10:09:51,643 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 433 transitions. Word has length 33 [2022-04-28 10:09:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:51,643 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 433 transitions. [2022-04-28 10:09:51,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:51,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 433 transitions. [2022-04-28 10:09:53,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 433 transitions. [2022-04-28 10:09:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:09:53,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:53,259 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:53,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:53,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:53,459 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 23 times [2022-04-28 10:09:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [974888856] [2022-04-28 10:09:53,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:53,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:53,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 24 times [2022-04-28 10:09:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:53,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6686123] [2022-04-28 10:09:53,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:53,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {67802#(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); {67783#true} is VALID [2022-04-28 10:09:53,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-28 10:09:53,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-28 10:09:53,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:53,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {67802#(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); {67783#true} is VALID [2022-04-28 10:09:53,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-28 10:09:53,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-28 10:09:53,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-28 10:09:53,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67788#(= main_~y~0 0)} is VALID [2022-04-28 10:09:53,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {67788#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:53,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:53,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:53,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:53,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {67795#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:53,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {67795#(and (<= main_~z~0 6) (<= 6 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; {67796#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:53,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {67796#(and (<= main_~z~0 5) (<= 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; {67797#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:53,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {67797#(and (<= 4 main_~z~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; {67798#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:53,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {67798#(and (<= main_~z~0 3) (<= 3 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; {67799#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:53,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {67799#(and (<= main_~z~0 2) (<= 2 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; {67800#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:53,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {67800#(and (<= main_~z~0 1) (<= 1 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; {67801#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:53,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {67801#(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; {67784#false} is VALID [2022-04-28 10:09:53,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {67784#false} assume !(~z~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {67784#false} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-28 10:09:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:53,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6686123] [2022-04-28 10:09:53,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6686123] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:53,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748149522] [2022-04-28 10:09:53,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:53,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:53,655 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:53,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 10:09:53,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:09:53,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:53,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:09:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:53,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:53,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67783#true} is VALID [2022-04-28 10:09:53,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#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); {67783#true} is VALID [2022-04-28 10:09:53,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-28 10:09:53,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-28 10:09:53,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67788#(= main_~y~0 0)} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {67788#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:53,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:53,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:53,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:53,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:53,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {67845#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {67845#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 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; {67849#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:53,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {67849#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= 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; {67853#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {67853#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 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; {67857#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {67857#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 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; {67861#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {67861#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 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; {67865#(and (<= main_~y~0 6) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {67865#(and (<= main_~y~0 6) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 6 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; {67869#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {67869#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {67784#false} assume !(~z~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#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; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {67784#false} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-28 10:09:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:53,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:54,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-28 10:09:54,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-28 10:09:54,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-28 10:09:54,385 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-28 10:09:54,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:54,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {67927#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-28 10:09:54,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {67931#(< 0 (mod (+ main_~y~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; {67927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:54,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {67935#(< 0 (mod (+ main_~y~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; {67931#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:54,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {67939#(< 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; {67935#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:54,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {67943#(< 0 (mod (+ 4294967292 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; {67939#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:54,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {67947#(< 0 (mod (+ 4294967291 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; {67943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:54,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {67951#(< 0 (mod (+ 4294967290 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; {67947#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:54,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:54,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {67958#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 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; {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:54,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {67962#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 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; {67958#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:54,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {67966#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 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; {67962#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:54,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {67970#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 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; {67966#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:54,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {67974#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 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; {67970#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:54,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {67978#(or (< 0 (mod (+ 4294967290 main_~y~0) 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; {67974#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:54,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {67982#(or (< 0 (mod (+ 4294967290 main_~y~0) 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; {67978#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {67783#true} ~z~0 := ~y~0; {67982#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {67783#true} assume !(~x~0 % 4294967296 > 0); {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#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); {67783#true} is VALID [2022-04-28 10:09:54,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67783#true} is VALID [2022-04-28 10:09:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:09:54,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748149522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:54,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:54,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-28 10:09:54,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:54,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [974888856] [2022-04-28 10:09:54,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [974888856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:54,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:54,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:54,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407343566] [2022-04-28 10:09:54,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:54,397 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 34 [2022-04-28 10:09:54,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:54,397 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-28 10:09:54,415 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-28 10:09:54,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:09:54,415 INFO L87 Difference]: Start difference. First operand 317 states and 433 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-28 10:09:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:57,974 INFO L93 Difference]: Finished difference Result 388 states and 509 transitions. [2022-04-28 10:09:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:09:57,974 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 34 [2022-04-28 10:09:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:57,974 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-28 10:09:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-28 10:09:57,975 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-28 10:09:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-28 10:09:57,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 95 transitions. [2022-04-28 10:09:58,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:58,061 INFO L225 Difference]: With dead ends: 388 [2022-04-28 10:09:58,061 INFO L226 Difference]: Without dead ends: 350 [2022-04-28 10:09:58,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:09:58,062 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:58,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 91 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-28 10:09:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 316. [2022-04-28 10:09:59,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:59,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:59,295 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:59,295 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:59,299 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2022-04-28 10:09:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 467 transitions. [2022-04-28 10:09:59,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:59,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:59,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 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 350 states. [2022-04-28 10:09:59,300 INFO L87 Difference]: Start difference. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 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 350 states. [2022-04-28 10:09:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:59,303 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2022-04-28 10:09:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 467 transitions. [2022-04-28 10:09:59,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:59,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:59,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:59,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 428 transitions. [2022-04-28 10:09:59,308 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 428 transitions. Word has length 34 [2022-04-28 10:09:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:59,308 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 428 transitions. [2022-04-28 10:09:59,308 INFO L496 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-28 10:09:59,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 428 transitions. [2022-04-28 10:10:02,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 428 transitions. [2022-04-28 10:10:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:02,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:02,415 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:02,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:02,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-28 10:10:02,615 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 37 times [2022-04-28 10:10:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1283309850] [2022-04-28 10:10:02,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:02,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 38 times [2022-04-28 10:10:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:02,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77564245] [2022-04-28 10:10:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:02,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {70241#(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); {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:02,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {70241#(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); {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-28 10:10:02,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-28 10:10:02,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70220#(= main_~y~0 0)} is VALID [2022-04-28 10:10:02,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {70220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:02,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:02,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:02,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:02,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:02,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:02,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:02,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:02,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:02,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:02,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:02,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:02,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:02,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:02,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:02,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:02,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:02,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:02,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:02,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:02,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {70240#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:02,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {70240#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:02,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:02,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:02,958 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-28 10:10:02,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-28 10:10:02,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-28 10:10:02,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-28 10:10:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77564245] [2022-04-28 10:10:02,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77564245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221232315] [2022-04-28 10:10:02,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:02,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:02,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:02,960 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:02,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 10:10:02,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:02,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:02,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:03,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70215#true} is VALID [2022-04-28 10:10:03,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#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); {70215#true} is VALID [2022-04-28 10:10:03,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-28 10:10:03,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-28 10:10:03,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-28 10:10:03,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70220#(= main_~y~0 0)} is VALID [2022-04-28 10:10:03,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {70220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:03,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:03,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:03,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:03,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:03,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:03,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:03,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:03,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:03,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:03,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:03,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:03,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:03,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:03,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:03,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:03,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:03,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {70323#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:10:03,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {70323#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,297 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-28 10:10:03,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-28 10:10:03,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-28 10:10:03,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-28 10:10:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:03,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:03,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {70363#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-28 10:10:03,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {70367#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {70363#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:03,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {70367#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:03,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {70374#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:03,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {70378#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70374#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:03,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {70382#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70378#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:03,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {70386#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70382#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:03,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {70390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70386#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:03,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {70394#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:03,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {70398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70394#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:03,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {70402#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:03,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {70406#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70402#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:03,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {70410#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70406#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:03,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {70414#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70410#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:03,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {70418#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70414#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:03,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {70422#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70418#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:03,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {70426#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70422#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:03,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {70430#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70426#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:03,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {70434#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70430#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:03,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {70438#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70434#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:03,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {70442#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70438#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:10:03,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {70446#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70442#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:10:03,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70446#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:03,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-28 10:10:03,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-28 10:10:03,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-28 10:10:03,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#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); {70215#true} is VALID [2022-04-28 10:10:03,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70215#true} is VALID [2022-04-28 10:10:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:03,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221232315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:03,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:03,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:03,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:03,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1283309850] [2022-04-28 10:10:03,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1283309850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:03,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:03,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144252384] [2022-04-28 10:10:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:03,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:03,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:03,991 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-28 10:10:03,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:03,992 INFO L87 Difference]: Start difference. First operand 316 states and 428 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:11,935 INFO L93 Difference]: Finished difference Result 556 states and 845 transitions. [2022-04-28 10:10:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:10:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-28 10:10:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-28 10:10:11,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 209 transitions. [2022-04-28 10:10:12,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:12,098 INFO L225 Difference]: With dead ends: 556 [2022-04-28 10:10:12,098 INFO L226 Difference]: Without dead ends: 531 [2022-04-28 10:10:12,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:10:12,099 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 158 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:12,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 200 Invalid, 3494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:10:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-04-28 10:10:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 333. [2022-04-28 10:10:13,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:13,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,369 INFO L74 IsIncluded]: Start isIncluded. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,369 INFO L87 Difference]: Start difference. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,378 INFO L93 Difference]: Finished difference Result 531 states and 671 transitions. [2022-04-28 10:10:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2022-04-28 10:10:13,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 531 states. [2022-04-28 10:10:13,379 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 531 states. [2022-04-28 10:10:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,387 INFO L93 Difference]: Finished difference Result 531 states and 671 transitions. [2022-04-28 10:10:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2022-04-28 10:10:13,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:13,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:13,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:13,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-28 10:10:13,392 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 34 [2022-04-28 10:10:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:13,392 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-28 10:10:13,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 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-28 10:10:13,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-28 10:10:15,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-28 10:10:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:15,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:15,680 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:15,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:15,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 10:10:15,895 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:15,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 45 times [2022-04-28 10:10:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17292327] [2022-04-28 10:10:15,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:15,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 46 times [2022-04-28 10:10:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103901971] [2022-04-28 10:10:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {73370#(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); {73349#true} is VALID [2022-04-28 10:10:16,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-28 10:10:16,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-28 10:10:16,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:16,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {73370#(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); {73349#true} is VALID [2022-04-28 10:10:16,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-28 10:10:16,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-28 10:10:16,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-28 10:10:16,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:16,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:10:16,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:16,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:10:16,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73359#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {73359#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} ~z~0 := ~y~0; {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 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; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-28 10:10:16,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~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; {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-28 10:10:16,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= 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; {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:16,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~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; {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= 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; {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:10:16,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:10:16,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:16,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-28 10:10:16,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-28 10:10:16,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:10:16,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:10:16,424 INFO L272 TraceCheckUtils]: 31: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:16,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {73368#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {73369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:16,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {73369#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {73350#false} is VALID [2022-04-28 10:10:16,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-28 10:10:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:10:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103901971] [2022-04-28 10:10:16,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103901971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68525476] [2022-04-28 10:10:16,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:16,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:16,426 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:16,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 10:10:16,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:16,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:16,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 10:10:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:20,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73349#true} is VALID [2022-04-28 10:10:20,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#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); {73349#true} is VALID [2022-04-28 10:10:20,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-28 10:10:20,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-28 10:10:20,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-28 10:10:20,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:20,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:20,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:10:22,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:22,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:10:22,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73404#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {73404#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} ~z~0 := ~y~0; {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 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; {73415#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {73415#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0) (<= main_~y~0 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; {73419#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {73419#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 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; {73423#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 5) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:10:22,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {73423#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 5) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73427#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {73427#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 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; {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 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; {73438#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:22,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {73438#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 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; {73442#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:22,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {73442#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 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; {73446#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 2) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)))))} is VALID [2022-04-28 10:10:22,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {73446#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 2) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 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; {73450#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:22,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {73450#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~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; {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:10:22,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:10:22,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73461#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:22,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {73461#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73465#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:10:22,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {73465#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73469#(and (<= main_~y~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:22,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {73469#(and (<= main_~y~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73473#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:10:22,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {73473#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:22,804 INFO L272 TraceCheckUtils]: 31: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:22,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:22,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {73487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73350#false} is VALID [2022-04-28 10:10:22,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-28 10:10:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:22,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:25,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-28 10:10:25,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {73487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73350#false} is VALID [2022-04-28 10:10:25,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:25,642 INFO L272 TraceCheckUtils]: 31: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:25,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:10:25,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:25,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:25,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:25,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:25,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {73533#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 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; {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:25,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {73537#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 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; {73533#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-28 10:10:25,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {73541#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 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; {73537#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {73545#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 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; {73541#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 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; {73545#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {73556#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 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; {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {73560#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {73556#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {73564#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 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; {73560#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {73568#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {73564#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:25,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {73568#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:10:25,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:25,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:25,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:25,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:10:25,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:10:25,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-28 10:10:25,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-28 10:10:25,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-28 10:10:25,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#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); {73349#true} is VALID [2022-04-28 10:10:25,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73349#true} is VALID [2022-04-28 10:10:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:25,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68525476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:25,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:25,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 20] total 52 [2022-04-28 10:10:25,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:25,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17292327] [2022-04-28 10:10:25,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17292327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:25,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:25,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:10:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760417335] [2022-04-28 10:10:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:25,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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 35 [2022-04-28 10:10:25,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:25,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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-28 10:10:25,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-28 10:10:25,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:10:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:10:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2255, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:10:25,721 INFO L87 Difference]: Start difference. First operand 333 states and 453 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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-28 10:10:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:29,458 INFO L93 Difference]: Finished difference Result 350 states and 470 transitions. [2022-04-28 10:10:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:10:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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 35 [2022-04-28 10:10:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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-28 10:10:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2022-04-28 10:10:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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-28 10:10:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2022-04-28 10:10:29,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2022-04-28 10:10:29,512 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-28 10:10:29,523 INFO L225 Difference]: With dead ends: 350 [2022-04-28 10:10:29,524 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 10:10:29,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=547, Invalid=4009, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:10:29,525 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:29,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 10:10:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2022-04-28 10:10:30,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:30,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,838 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,838 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:30,842 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-28 10:10:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-28 10:10:30,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:30,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:30,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 345 states. [2022-04-28 10:10:30,843 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 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 345 states. [2022-04-28 10:10:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:30,847 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-28 10:10:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-28 10:10:30,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:30,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:30,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:30,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-28 10:10:30,852 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 35 [2022-04-28 10:10:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:30,853 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-28 10:10:30,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 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-28 10:10:30,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-28 10:10:34,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 452 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-28 10:10:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:34,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:34,624 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:34,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:34,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:34,824 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 47 times [2022-04-28 10:10:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826057656] [2022-04-28 10:10:34,826 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:34,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 48 times [2022-04-28 10:10:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147230031] [2022-04-28 10:10:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {75718#(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); {75701#true} is VALID [2022-04-28 10:10:34,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-28 10:10:34,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-28 10:10:34,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:34,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {75718#(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); {75701#true} is VALID [2022-04-28 10:10:34,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-28 10:10:34,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-28 10:10:34,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-28 10:10:34,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75706#(= main_~y~0 0)} is VALID [2022-04-28 10:10:34,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {75706#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:34,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:34,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:34,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:34,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:34,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:34,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:34,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:34,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:34,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {75714#(and (<= main_~z~0 7) (<= 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; {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:35,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {75715#(and (<= main_~z~0 6) (<= 6 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; {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:35,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {75716#(and (<= main_~z~0 5) (<= 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; {75717#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {75717#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-28 10:10:35,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-28 10:10:35,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-28 10:10:35,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-28 10:10:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:10:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147230031] [2022-04-28 10:10:35,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147230031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206997893] [2022-04-28 10:10:35,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:35,003 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:35,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 10:10:35,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:10:35,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:35,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:10:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:35,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:35,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75701#true} is VALID [2022-04-28 10:10:35,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#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); {75701#true} is VALID [2022-04-28 10:10:35,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-28 10:10:35,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-28 10:10:35,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-28 10:10:35,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75706#(= main_~y~0 0)} is VALID [2022-04-28 10:10:35,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {75706#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:35,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:35,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:35,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:35,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:35,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:35,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:35,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:35,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:35,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {75714#(and (<= main_~z~0 7) (<= 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; {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:35,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {75715#(and (<= main_~z~0 6) (<= 6 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; {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:35,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {75716#(and (<= main_~z~0 5) (<= 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; {75773#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {75773#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,293 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-28 10:10:35,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-28 10:10:35,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-28 10:10:35,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-28 10:10:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:10:35,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:35,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-28 10:10:35,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-28 10:10:35,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#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; {75702#false} is VALID [2022-04-28 10:10:35,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {75873#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-28 10:10:35,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {75877#(< 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; {75873#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:35,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {75881#(< 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; {75877#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:35,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {75885#(< 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; {75881#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:35,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {75885#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:35,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:35,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {75896#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:35,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {75900#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75896#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:35,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {75904#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75900#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:35,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {75908#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75904#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:35,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {75912#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75908#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:35,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {75916#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75912#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:35,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {75920#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75916#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:35,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75920#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:35,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-28 10:10:35,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-28 10:10:35,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-28 10:10:35,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#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); {75701#true} is VALID [2022-04-28 10:10:35,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75701#true} is VALID [2022-04-28 10:10:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:10:35,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206997893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:35,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:35,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:10:35,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:35,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826057656] [2022-04-28 10:10:35,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826057656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:35,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:35,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:10:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243869567] [2022-04-28 10:10:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:35,564 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 35 [2022-04-28 10:10:35,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:35,564 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-28 10:10:35,580 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-28 10:10:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:10:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:10:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:10:35,580 INFO L87 Difference]: Start difference. First operand 333 states and 453 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-28 10:10:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:39,029 INFO L93 Difference]: Finished difference Result 414 states and 541 transitions. [2022-04-28 10:10:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:39,029 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 35 [2022-04-28 10:10:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:39,030 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-28 10:10:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2022-04-28 10:10:39,030 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-28 10:10:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2022-04-28 10:10:39,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 89 transitions. [2022-04-28 10:10:39,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:39,103 INFO L225 Difference]: With dead ends: 414 [2022-04-28 10:10:39,103 INFO L226 Difference]: Without dead ends: 397 [2022-04-28 10:10:39,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:10:39,103 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:39,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 90 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-28 10:10:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 333. [2022-04-28 10:10:40,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:40,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:40,431 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:40,432 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:40,437 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2022-04-28 10:10:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 524 transitions. [2022-04-28 10:10:40,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:40,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:40,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 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 397 states. [2022-04-28 10:10:40,438 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 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 397 states. [2022-04-28 10:10:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:40,444 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2022-04-28 10:10:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 524 transitions. [2022-04-28 10:10:40,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:40,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:40,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:40,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 452 transitions. [2022-04-28 10:10:40,452 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 452 transitions. Word has length 35 [2022-04-28 10:10:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:40,452 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 452 transitions. [2022-04-28 10:10:40,452 INFO L496 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-28 10:10:40,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 452 transitions. [2022-04-28 10:10:42,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 452 transitions. [2022-04-28 10:10:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:42,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:42,161 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:42,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-28 10:10:42,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:42,361 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 49 times [2022-04-28 10:10:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:42,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484139769] [2022-04-28 10:10:42,363 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:42,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 50 times [2022-04-28 10:10:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:42,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042729818] [2022-04-28 10:10:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:42,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {78280#(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); {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:42,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {78280#(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); {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-28 10:10:42,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78268#(= main_~y~0 0)} is VALID [2022-04-28 10:10:42,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {78268#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:42,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:42,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:42,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:42,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:42,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:42,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:42,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:42,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:42,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:42,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {78278#(and (<= main_~z~0 7) (<= 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; {78279#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {78279#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:42,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-28 10:10:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:10:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042729818] [2022-04-28 10:10:42,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042729818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371941630] [2022-04-28 10:10:42,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:42,535 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:42,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 10:10:42,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:42,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:42,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:10:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:42,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:42,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78263#true} is VALID [2022-04-28 10:10:42,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#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); {78263#true} is VALID [2022-04-28 10:10:42,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-28 10:10:42,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-28 10:10:42,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-28 10:10:42,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78268#(= main_~y~0 0)} is VALID [2022-04-28 10:10:42,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {78268#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:42,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:42,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:42,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:42,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:42,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:42,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:42,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:42,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:42,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:42,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {78278#(and (<= main_~z~0 7) (<= 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; {78335#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {78335#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-28 10:10:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:10:42,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:43,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#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; {78264#false} is VALID [2022-04-28 10:10:43,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {78435#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-28 10:10:43,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {78439#(< 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; {78435#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:43,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {78443#(< 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; {78439#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:43,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {78443#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:43,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:43,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {78454#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:43,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {78458#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78454#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:43,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {78462#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78458#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:43,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {78466#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78462#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:43,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {78470#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78466#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:43,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {78474#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78470#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:43,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {78478#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78474#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:43,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {78482#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78478#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:43,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78482#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:43,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-28 10:10:43,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-28 10:10:43,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-28 10:10:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#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); {78263#true} is VALID [2022-04-28 10:10:43,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78263#true} is VALID [2022-04-28 10:10:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:10:43,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371941630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:43,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:43,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:10:43,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:43,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484139769] [2022-04-28 10:10:43,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484139769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:43,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:43,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:10:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537780588] [2022-04-28 10:10:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:43,073 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 35 [2022-04-28 10:10:43,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:43,074 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-28 10:10:43,094 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-28 10:10:43,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:10:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:10:43,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:10:43,095 INFO L87 Difference]: Start difference. First operand 333 states and 452 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-28 10:10:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:46,710 INFO L93 Difference]: Finished difference Result 433 states and 560 transitions. [2022-04-28 10:10:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:10:46,711 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 35 [2022-04-28 10:10:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:46,711 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-28 10:10:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2022-04-28 10:10:46,712 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-28 10:10:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2022-04-28 10:10:46,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 95 transitions. [2022-04-28 10:10:46,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:46,800 INFO L225 Difference]: With dead ends: 433 [2022-04-28 10:10:46,800 INFO L226 Difference]: Without dead ends: 416 [2022-04-28 10:10:46,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:10:46,801 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 51 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:46,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 90 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-04-28 10:10:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 333. [2022-04-28 10:10:48,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:48,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:48,125 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:48,125 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:48,130 INFO L93 Difference]: Finished difference Result 416 states and 543 transitions. [2022-04-28 10:10:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 543 transitions. [2022-04-28 10:10:48,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:48,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:48,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 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 416 states. [2022-04-28 10:10:48,131 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 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 416 states. [2022-04-28 10:10:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:48,137 INFO L93 Difference]: Finished difference Result 416 states and 543 transitions. [2022-04-28 10:10:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 543 transitions. [2022-04-28 10:10:48,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:48,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:48,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:48,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2022-04-28 10:10:48,142 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 35 [2022-04-28 10:10:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:48,142 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2022-04-28 10:10:48,142 INFO L496 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-28 10:10:48,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 451 transitions. [2022-04-28 10:10:49,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2022-04-28 10:10:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:49,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:49,715 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:49,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-28 10:10:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:49,916 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 51 times [2022-04-28 10:10:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591320348] [2022-04-28 10:10:49,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:49,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 52 times [2022-04-28 10:10:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:49,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113170216] [2022-04-28 10:10:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:50,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {80914#(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); {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:50,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {80914#(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); {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-28 10:10:50,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80902#(= main_~y~0 0)} is VALID [2022-04-28 10:10:50,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {80902#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:50,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:50,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:50,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:50,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:50,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:50,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:50,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:50,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:50,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:50,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:50,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80913#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {80913#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,080 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-28 10:10:50,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-28 10:10:50,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-28 10:10:50,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-28 10:10:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:10:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113170216] [2022-04-28 10:10:50,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113170216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770113729] [2022-04-28 10:10:50,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:50,082 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:50,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 10:10:50,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:50,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:50,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:10:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:50,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80897#true} is VALID [2022-04-28 10:10:50,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#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); {80897#true} is VALID [2022-04-28 10:10:50,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-28 10:10:50,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-28 10:10:50,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-28 10:10:50,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80902#(= main_~y~0 0)} is VALID [2022-04-28 10:10:50,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {80902#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:50,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:50,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:50,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:50,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:50,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:50,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:50,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:50,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:50,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:50,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:50,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80969#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {80969#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,340 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-28 10:10:50,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-28 10:10:50,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-28 10:10:50,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-28 10:10:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:10:50,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#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; {80898#false} is VALID [2022-04-28 10:10:50,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {81069#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-28 10:10:50,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {81073#(< 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; {81069#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:50,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {81073#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:50,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:50,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {81084#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:50,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {81088#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81084#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:50,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {81092#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81088#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:50,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {81096#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81092#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:50,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {81100#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81096#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:50,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {81104#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81100#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:50,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {81108#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81104#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:50,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {81112#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81108#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:50,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {81116#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81112#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:50,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81116#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:50,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-28 10:10:50,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-28 10:10:50,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-28 10:10:50,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#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); {80897#true} is VALID [2022-04-28 10:10:50,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80897#true} is VALID [2022-04-28 10:10:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:10:50,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770113729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:50,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:50,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:10:50,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:50,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591320348] [2022-04-28 10:10:50,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591320348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:50,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:50,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:10:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594998355] [2022-04-28 10:10:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:50,614 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 35 [2022-04-28 10:10:50,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:50,614 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-28 10:10:50,629 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-28 10:10:50,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:10:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:10:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:10:50,629 INFO L87 Difference]: Start difference. First operand 333 states and 451 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-28 10:10:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:54,561 INFO L93 Difference]: Finished difference Result 453 states and 580 transitions. [2022-04-28 10:10:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:54,561 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 35 [2022-04-28 10:10:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:54,561 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-28 10:10:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-04-28 10:10:54,562 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-28 10:10:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-04-28 10:10:54,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 101 transitions. [2022-04-28 10:10:54,633 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-28 10:10:54,640 INFO L225 Difference]: With dead ends: 453 [2022-04-28 10:10:54,640 INFO L226 Difference]: Without dead ends: 436 [2022-04-28 10:10:54,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:10:54,641 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:54,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 101 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:10:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-04-28 10:10:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 333. [2022-04-28 10:10:55,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:55,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:55,988 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:55,989 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:55,995 INFO L93 Difference]: Finished difference Result 436 states and 563 transitions. [2022-04-28 10:10:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 563 transitions. [2022-04-28 10:10:55,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:55,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:55,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 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 436 states. [2022-04-28 10:10:55,995 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 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 436 states. [2022-04-28 10:10:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:56,001 INFO L93 Difference]: Finished difference Result 436 states and 563 transitions. [2022-04-28 10:10:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 563 transitions. [2022-04-28 10:10:56,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:56,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:56,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:56,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2022-04-28 10:10:56,007 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 35 [2022-04-28 10:10:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:56,007 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2022-04-28 10:10:56,007 INFO L496 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-28 10:10:56,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 450 transitions. [2022-04-28 10:10:59,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2022-04-28 10:10:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:59,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:59,722 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:59,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:59,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 10:10:59,923 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 39 times [2022-04-28 10:10:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:59,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489010863] [2022-04-28 10:10:59,925 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:59,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 40 times [2022-04-28 10:10:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234856678] [2022-04-28 10:10:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {83634#(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); {83607#true} is VALID [2022-04-28 10:11:00,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-28 10:11:00,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-28 10:11:00,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:00,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {83634#(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); {83607#true} is VALID [2022-04-28 10:11:00,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-28 10:11:00,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-28 10:11:00,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-28 10:11:00,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83612#(= main_~y~0 0)} is VALID [2022-04-28 10:11:00,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {83612#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:00,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:00,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:00,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:00,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:00,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:00,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:00,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:00,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:00,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:00,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:00,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:00,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:00,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:00,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:00,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:00,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:00,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:00,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:00,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:00,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:00,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {83633#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:11:00,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {83633#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-28 10:11:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234856678] [2022-04-28 10:11:00,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234856678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087160925] [2022-04-28 10:11:00,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:00,278 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:00,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 10:11:00,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:00,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:00,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:00,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83607#true} is VALID [2022-04-28 10:11:00,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#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); {83607#true} is VALID [2022-04-28 10:11:00,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-28 10:11:00,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-28 10:11:00,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-28 10:11:00,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83612#(= main_~y~0 0)} is VALID [2022-04-28 10:11:00,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {83612#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:00,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:00,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:00,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:00,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:00,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:00,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:00,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:00,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:00,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:00,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:00,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:00,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:00,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:00,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:00,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:00,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:00,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:00,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:00,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:00,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:00,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {83719#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {83719#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-28 10:11:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:00,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:01,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-28 10:11:01,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-28 10:11:01,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-28 10:11:01,344 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-28 10:11:01,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:01,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:01,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {83759#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-28 10:11:01,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {83763#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {83759#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:01,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {83763#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {83763#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:01,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {83770#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83763#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:01,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {83774#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83770#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:01,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {83778#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83774#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:01,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {83782#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83778#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:01,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {83786#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83782#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:01,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {83790#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83786#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:01,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {83794#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83790#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:01,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {83798#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83794#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:01,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {83802#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83798#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:01,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {83806#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83802#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:01,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {83810#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83806#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:01,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {83814#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83810#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:01,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {83818#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83814#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:01,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {83822#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83818#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:01,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {83826#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83822#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:01,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {83830#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83826#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:01,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {83834#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83830#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:01,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {83838#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83834#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:01,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {83842#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83838#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:01,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {83846#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83842#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:01,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83846#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:11:01,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-28 10:11:01,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-28 10:11:01,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-28 10:11:01,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#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); {83607#true} is VALID [2022-04-28 10:11:01,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83607#true} is VALID [2022-04-28 10:11:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:01,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087160925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:01,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:01,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:11:01,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:01,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489010863] [2022-04-28 10:11:01,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489010863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:01,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:01,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717629243] [2022-04-28 10:11:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:01,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:01,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:01,379 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-28 10:11:01,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:01,380 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:10,028 INFO L93 Difference]: Finished difference Result 582 states and 884 transitions. [2022-04-28 10:11:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 219 transitions. [2022-04-28 10:11:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 219 transitions. [2022-04-28 10:11:10,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 219 transitions. [2022-04-28 10:11:10,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:10,230 INFO L225 Difference]: With dead ends: 582 [2022-04-28 10:11:10,230 INFO L226 Difference]: Without dead ends: 557 [2022-04-28 10:11:10,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:11:10,231 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 165 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:10,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 210 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 10:11:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-28 10:11:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 350. [2022-04-28 10:11:11,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:11,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,616 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,616 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,625 INFO L93 Difference]: Finished difference Result 557 states and 703 transitions. [2022-04-28 10:11:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 703 transitions. [2022-04-28 10:11:11,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:11,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:11,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 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 557 states. [2022-04-28 10:11:11,629 INFO L87 Difference]: Start difference. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 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 557 states. [2022-04-28 10:11:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,638 INFO L93 Difference]: Finished difference Result 557 states and 703 transitions. [2022-04-28 10:11:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 703 transitions. [2022-04-28 10:11:11,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:11,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:11,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:11,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 475 transitions. [2022-04-28 10:11:11,644 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 475 transitions. Word has length 35 [2022-04-28 10:11:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:11,644 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 475 transitions. [2022-04-28 10:11:11,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 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-28 10:11:11,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 350 states and 475 transitions. [2022-04-28 10:11:13,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 475 transitions. [2022-04-28 10:11:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:13,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:13,941 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:13,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-28 10:11:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-04-28 10:11:14,141 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 53 times [2022-04-28 10:11:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329371005] [2022-04-28 10:11:14,144 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:14,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 54 times [2022-04-28 10:11:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:14,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504378278] [2022-04-28 10:11:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {86900#(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); {86889#true} is VALID [2022-04-28 10:11:14,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-28 10:11:14,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-28 10:11:14,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {86900#(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); {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {86894#(<= 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; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {86895#(<= 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; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {86896#(<= 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; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {86897#(<= 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; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {86898#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {86899#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {86898#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {86897#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {86895#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {86894#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {86890#false} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-28 10:11:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:14,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504378278] [2022-04-28 10:11:14,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504378278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:14,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057399837] [2022-04-28 10:11:14,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:14,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:14,254 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:14,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 10:11:14,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:11:14,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:14,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:11:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:14,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:14,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#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); {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {86894#(<= 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; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {86895#(<= 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; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {86896#(<= 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; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {86897#(<= 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; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {86898#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {86899#(<= 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; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:14,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {86899#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {86898#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {86897#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:14,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:14,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {86895#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:14,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {86894#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86994#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} is VALID [2022-04-28 10:11:14,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {86994#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-28 10:11:14,593 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-28 10:11:14,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-28 10:11:14,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-28 10:11:14,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-28 10:11:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:14,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:14,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-28 10:11:14,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-28 10:11:14,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-28 10:11:14,881 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-28 10:11:14,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {87022#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-28 10:11:14,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {87026#(< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87022#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:14,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {87030#(< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:14,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:14,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {87038#(< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:14,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {87046#(< 0 (mod (+ 4294967290 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {87046#(< 0 (mod (+ 4294967290 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {87046#(< 0 (mod (+ 4294967290 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {87046#(< 0 (mod (+ 4294967290 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {87046#(< 0 (mod (+ 4294967290 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {87042#(< 0 (mod (+ 4294967291 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; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {87038#(< 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; {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {87034#(< 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; {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:14,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {87030#(< 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; {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:14,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {87026#(< 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; {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:14,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} ~z~0 := ~y~0; {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#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); {86889#true} is VALID [2022-04-28 10:11:14,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86889#true} is VALID [2022-04-28 10:11:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:14,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057399837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:14,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:14,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-28 10:11:14,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:14,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329371005] [2022-04-28 10:11:14,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329371005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:14,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:14,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:11:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68006573] [2022-04-28 10:11:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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 36 [2022-04-28 10:11:14,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:14,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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-28 10:11:14,914 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-28 10:11:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:11:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:11:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:11:14,915 INFO L87 Difference]: Start difference. First operand 350 states and 475 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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-28 10:11:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,148 INFO L93 Difference]: Finished difference Result 374 states and 500 transitions. [2022-04-28 10:11:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:11:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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 36 [2022-04-28 10:11:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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-28 10:11:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:11:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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-28 10:11:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 10:11:17,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 10:11:17,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:17,197 INFO L225 Difference]: With dead ends: 374 [2022-04-28 10:11:17,197 INFO L226 Difference]: Without dead ends: 349 [2022-04-28 10:11:17,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:11:17,197 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:17,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:11:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-04-28 10:11:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 344. [2022-04-28 10:11:18,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:18,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,617 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,618 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,622 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-28 10:11:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-28 10:11:18,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 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 349 states. [2022-04-28 10:11:18,622 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 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 349 states. [2022-04-28 10:11:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,626 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-28 10:11:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-28 10:11:18,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:18,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 468 transitions. [2022-04-28 10:11:18,631 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 468 transitions. Word has length 36 [2022-04-28 10:11:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:18,632 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 468 transitions. [2022-04-28 10:11:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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-28 10:11:18,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 468 transitions. [2022-04-28 10:11:20,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 468 transitions. [2022-04-28 10:11:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:20,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:20,548 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-28 10:11:20,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-04-28 10:11:20,748 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 25 times [2022-04-28 10:11:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:20,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379308473] [2022-04-28 10:11:20,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:20,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 26 times [2022-04-28 10:11:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:20,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125730744] [2022-04-28 10:11:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:20,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {89289#(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); {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:20,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {89289#(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); {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-28 10:11:20,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89270#true} is VALID [2022-04-28 10:11:20,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {89270#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89275#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:20,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {89275#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89276#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:11:20,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {89276#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89277#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:20,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {89277#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89278#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:20,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {89278#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89279#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:20,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {89279#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89280#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:20,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {89280#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:20,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:20,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:20,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 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; {89282#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:11:20,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {89282#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 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; {89283#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:20,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {89283#(<= (+ 2 (* (div (+ 5 main_~x~0) 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; {89284#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-28 10:11:20,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {89284#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) 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; {89285#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-28 10:11:20,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {89285#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) 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; {89286#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:20,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {89286#(<= (+ 5 (* (div (+ main_~x~0 2) 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; {89287#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:20,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {89287#(<= (+ 6 (* (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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {89288#(<= (+ 7 (* 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; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:20,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {89271#false} is VALID [2022-04-28 10:11:20,969 INFO L272 TraceCheckUtils]: 32: Hoare triple {89271#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89271#false} is VALID [2022-04-28 10:11:20,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {89271#false} ~cond := #in~cond; {89271#false} is VALID [2022-04-28 10:11:20,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {89271#false} assume 0 == ~cond; {89271#false} is VALID [2022-04-28 10:11:20,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-28 10:11:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:20,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125730744] [2022-04-28 10:11:20,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125730744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812946265] [2022-04-28 10:11:20,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:20,971 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:20,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 10:11:21,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:21,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:21,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:11:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:21,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89270#true} is VALID [2022-04-28 10:11:21,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#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); {89270#true} is VALID [2022-04-28 10:11:21,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-28 10:11:21,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-28 10:11:21,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-28 10:11:21,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89312#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:11:21,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {89312#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89316#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-28 10:11:21,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {89316#(= main_~n~0 (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:11:21,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:11:21,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-28 10:11:21,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-28 10:11:21,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-28 10:11:21,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !(~x~0 % 4294967296 > 0); {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-28 10:11:21,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} ~z~0 := ~y~0; {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-28 10:11:21,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-28 10:11:21,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-28 10:11:21,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-28 10:11:21,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {89324#(= (+ main_~n~0 (- 3)) (+ 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; {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-28 10:11:21,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {89320#(= (+ (- 2) main_~n~0) (+ 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; {89316#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-28 10:11:21,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {89316#(= main_~n~0 (+ main_~x~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; {89312#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:11:21,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {89312#(= (+ main_~x~0 1) main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {89308#(= main_~n~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; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-28 10:11:21,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {89391#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 10:11:21,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {89391#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {89395#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-28 10:11:21,624 INFO L272 TraceCheckUtils]: 32: Hoare triple {89395#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:21,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:21,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {89403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89271#false} is VALID [2022-04-28 10:11:21,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-28 10:11:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:21,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:22,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-28 10:11:22,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {89403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89271#false} is VALID [2022-04-28 10:11:22,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:22,261 INFO L272 TraceCheckUtils]: 32: Hoare triple {89419#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:22,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {89423#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {89419#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:22,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {89423#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:11:22,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~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; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~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; {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:11:22,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~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; {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~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; {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 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; {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~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; {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-28 10:11:22,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-28 10:11:22,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-28 10:11:22,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-28 10:11:22,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:22,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-28 10:11:22,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-28 10:11:22,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-28 10:11:22,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#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); {89270#true} is VALID [2022-04-28 10:11:22,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89270#true} is VALID [2022-04-28 10:11:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:22,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812946265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:22,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:22,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-04-28 10:11:22,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:22,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379308473] [2022-04-28 10:11:22,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379308473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:22,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:22,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:11:22,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185703686] [2022-04-28 10:11:22,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:22,275 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 36 [2022-04-28 10:11:22,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:22,275 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-28 10:11:22,299 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-28 10:11:22,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:11:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:11:22,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:11:22,300 INFO L87 Difference]: Start difference. First operand 344 states and 468 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-28 10:11:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:25,312 INFO L93 Difference]: Finished difference Result 400 states and 553 transitions. [2022-04-28 10:11:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:11:25,312 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 36 [2022-04-28 10:11:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:25,312 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-28 10:11:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-28 10:11:25,312 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-28 10:11:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-28 10:11:25,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 91 transitions. [2022-04-28 10:11:25,393 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-28 10:11:25,399 INFO L225 Difference]: With dead ends: 400 [2022-04-28 10:11:25,399 INFO L226 Difference]: Without dead ends: 395 [2022-04-28 10:11:25,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=405, Invalid=2351, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:11:25,400 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:25,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 53 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-28 10:11:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-04-28 10:11:27,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:27,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:27,064 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:27,064 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,069 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-28 10:11:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-28 10:11:27,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:27,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:27,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:11:27,070 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 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 395 states. [2022-04-28 10:11:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,075 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-28 10:11:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-28 10:11:27,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:27,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:27,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:27,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2022-04-28 10:11:27,082 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 36 [2022-04-28 10:11:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:27,082 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2022-04-28 10:11:27,082 INFO L496 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-28 10:11:27,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 522 transitions. [2022-04-28 10:11:29,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2022-04-28 10:11:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:29,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:29,574 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:29,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:29,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:29,775 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 41 times [2022-04-28 10:11:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:29,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179257878] [2022-04-28 10:11:29,777 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:29,777 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 42 times [2022-04-28 10:11:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:29,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56129551] [2022-04-28 10:11:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {91937#(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); {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:30,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {91937#(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); {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-28 10:11:30,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-28 10:11:30,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91914#(= main_~y~0 0)} is VALID [2022-04-28 10:11:30,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {91914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:30,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:30,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:30,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:30,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:30,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:30,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:30,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:30,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:30,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:30,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:30,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:30,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:30,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:30,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:30,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:30,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:30,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:30,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:30,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:30,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:30,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {91936#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {91936#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,178 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-28 10:11:30,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-28 10:11:30,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-28 10:11:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56129551] [2022-04-28 10:11:30,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56129551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:30,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853526743] [2022-04-28 10:11:30,179 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:30,180 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:30,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 10:11:30,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:11:30,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:30,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:11:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:30,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:30,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91909#true} is VALID [2022-04-28 10:11:30,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#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); {91909#true} is VALID [2022-04-28 10:11:30,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-28 10:11:30,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-28 10:11:30,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-28 10:11:30,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91914#(= main_~y~0 0)} is VALID [2022-04-28 10:11:30,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {91914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:30,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:30,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:30,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:30,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:30,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:30,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:30,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:30,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:30,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:30,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:30,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:30,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:30,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:30,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:30,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:30,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:30,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:30,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:30,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:30,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:30,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:30,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {92025#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {92025#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-28 10:11:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:30,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:31,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {92065#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-28 10:11:31,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {92069#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {92065#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:31,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {92069#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {92069#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:31,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {92076#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92069#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:31,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {92080#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92076#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:31,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {92084#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92080#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:31,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {92088#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92084#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:31,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {92092#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92088#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:31,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {92096#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92092#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:31,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {92100#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92096#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:31,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {92104#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92100#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:31,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {92108#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92104#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:31,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {92112#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92108#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:31,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {92116#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92112#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:31,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {92120#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92116#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:31,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {92124#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92120#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:31,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {92128#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92124#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:31,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {92132#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92128#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:31,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {92136#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92132#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:31,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {92140#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92136#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:31,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {92144#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92140#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:31,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {92148#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92144#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:31,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {92152#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92148#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:31,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {92156#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92152#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:11:31,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92156#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:11:31,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-28 10:11:31,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-28 10:11:31,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-28 10:11:31,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#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); {91909#true} is VALID [2022-04-28 10:11:31,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91909#true} is VALID [2022-04-28 10:11:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:31,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853526743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:31,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:31,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:11:31,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:31,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179257878] [2022-04-28 10:11:31,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179257878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:31,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:31,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:11:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827176405] [2022-04-28 10:11:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 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 36 [2022-04-28 10:11:31,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:31,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:31,621 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-28 10:11:31,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:11:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:11:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:11:31,621 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,811 INFO L93 Difference]: Finished difference Result 674 states and 1031 transitions. [2022-04-28 10:11:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:11:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 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 36 [2022-04-28 10:11:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 225 transitions. [2022-04-28 10:11:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 225 transitions. [2022-04-28 10:11:41,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 225 transitions. [2022-04-28 10:11:41,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:42,010 INFO L225 Difference]: With dead ends: 674 [2022-04-28 10:11:42,010 INFO L226 Difference]: Without dead ends: 646 [2022-04-28 10:11:42,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:11:42,011 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 169 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:42,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 217 Invalid, 4149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:11:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-04-28 10:11:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 401. [2022-04-28 10:11:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:43,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:43,760 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:43,760 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:43,772 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2022-04-28 10:11:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2022-04-28 10:11:43,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:43,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:43,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 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 646 states. [2022-04-28 10:11:43,773 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 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 646 states. [2022-04-28 10:11:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:43,784 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2022-04-28 10:11:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2022-04-28 10:11:43,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:43,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:43,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:43,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 550 transitions. [2022-04-28 10:11:43,791 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 550 transitions. Word has length 36 [2022-04-28 10:11:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:43,791 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 550 transitions. [2022-04-28 10:11:43,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:43,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 550 transitions. [2022-04-28 10:11:46,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 550 transitions. [2022-04-28 10:11:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:11:46,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:46,487 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:46,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:46,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,688 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 55 times [2022-04-28 10:11:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:46,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679384047] [2022-04-28 10:11:46,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:46,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 56 times [2022-04-28 10:11:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255488068] [2022-04-28 10:11:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {95683#(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); {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:46,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {95683#(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); {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-28 10:11:46,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95670#(= main_~y~0 0)} is VALID [2022-04-28 10:11:46,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {95670#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:46,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:46,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:46,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:46,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:46,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:46,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:46,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:46,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {95678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:46,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {95678#(and (<= main_~z~0 7) (<= 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; {95679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:46,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {95679#(and (<= main_~z~0 6) (<= 6 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; {95680#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:46,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {95680#(and (<= main_~z~0 5) (<= 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; {95681#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:46,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {95681#(and (<= 4 main_~z~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; {95682#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:46,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {95682#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:46,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-28 10:11:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:11:46,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:46,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255488068] [2022-04-28 10:11:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255488068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011916226] [2022-04-28 10:11:46,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:46,864 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:46,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 10:11:46,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:46,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:46,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:11:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:47,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95665#true} is VALID [2022-04-28 10:11:47,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#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); {95665#true} is VALID [2022-04-28 10:11:47,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-28 10:11:47,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-28 10:11:47,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-28 10:11:47,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95670#(= main_~y~0 0)} is VALID [2022-04-28 10:11:47,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {95670#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:47,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:47,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:47,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:47,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:47,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:47,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {95729#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {95729#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95733#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:47,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {95733#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= 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; {95737#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {95737#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95741#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:11:47,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {95741#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= 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; {95745#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {95745#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-28 10:11:47,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-28 10:11:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:11:47,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#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; {95666#false} is VALID [2022-04-28 10:11:47,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {95836#(not (< 0 (mod 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; {95666#false} is VALID [2022-04-28 10:11:47,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {95840#(not (< 0 (mod (+ main_~y~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; {95836#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:11:47,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {95844#(not (< 0 (mod (+ main_~y~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; {95840#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:47,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {95848#(not (< 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; {95844#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:47,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {95852#(not (< 0 (mod (+ 4294967292 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; {95848#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:47,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {95856#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {95852#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:47,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {95860#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 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; {95856#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:47,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {95864#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {95860#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:47,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {95868#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 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; {95864#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:47,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {95872#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 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; {95868#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:47,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {95665#true} ~z~0 := ~y~0; {95872#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:47,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {95665#true} assume !(~x~0 % 4294967296 > 0); {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#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); {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95665#true} is VALID [2022-04-28 10:11:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 10:11:47,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011916226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:47,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-28 10:11:47,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:47,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679384047] [2022-04-28 10:11:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679384047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:47,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:47,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:11:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312344025] [2022-04-28 10:11:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:47,457 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 37 [2022-04-28 10:11:47,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:47,457 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-28 10:11:47,474 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-28 10:11:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:11:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:11:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:11:47,475 INFO L87 Difference]: Start difference. First operand 401 states and 550 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-28 10:11:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:51,727 INFO L93 Difference]: Finished difference Result 486 states and 642 transitions. [2022-04-28 10:11:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:11:51,728 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 37 [2022-04-28 10:11:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:51,728 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-28 10:11:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 10:11:51,728 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-28 10:11:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 10:11:51,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-28 10:11:51,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:51,804 INFO L225 Difference]: With dead ends: 486 [2022-04-28 10:11:51,804 INFO L226 Difference]: Without dead ends: 468 [2022-04-28 10:11:51,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=1966, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:51,805 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:51,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 93 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-28 10:11:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 401. [2022-04-28 10:11:53,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:53,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:53,558 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:53,559 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:53,566 INFO L93 Difference]: Finished difference Result 468 states and 624 transitions. [2022-04-28 10:11:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 624 transitions. [2022-04-28 10:11:53,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:53,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:53,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 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 468 states. [2022-04-28 10:11:53,566 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 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 468 states. [2022-04-28 10:11:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:53,573 INFO L93 Difference]: Finished difference Result 468 states and 624 transitions. [2022-04-28 10:11:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 624 transitions. [2022-04-28 10:11:53,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:53,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:53,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:53,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 549 transitions. [2022-04-28 10:11:53,580 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 549 transitions. Word has length 37 [2022-04-28 10:11:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:53,580 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 549 transitions. [2022-04-28 10:11:53,580 INFO L496 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-28 10:11:53,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 549 transitions. [2022-04-28 10:11:56,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 549 edges. 549 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 549 transitions. [2022-04-28 10:11:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:11:56,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:56,039 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:56,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-28 10:11:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-28 10:11:56,243 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 27 times [2022-04-28 10:11:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1283507931] [2022-04-28 10:11:56,248 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:56,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 28 times [2022-04-28 10:11:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:56,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180212032] [2022-04-28 10:11:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {98685#(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); {98664#true} is VALID [2022-04-28 10:11:56,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-28 10:11:56,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-28 10:11:56,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:56,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {98685#(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); {98664#true} is VALID [2022-04-28 10:11:56,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-28 10:11:56,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-28 10:11:56,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-28 10:11:56,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98669#(= main_~y~0 0)} is VALID [2022-04-28 10:11:56,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {98669#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:56,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:56,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:56,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:56,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:56,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:56,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {98677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:56,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {98677#(and (<= main_~z~0 7) (<= 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; {98678#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:56,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {98678#(and (<= main_~z~0 6) (<= 6 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; {98679#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:56,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {98679#(and (<= main_~z~0 5) (<= 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; {98680#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:56,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {98680#(and (<= 4 main_~z~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; {98681#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:56,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {98681#(and (<= main_~z~0 3) (<= 3 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; {98682#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:56,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {98682#(and (<= main_~z~0 2) (<= 2 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; {98683#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:56,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {98683#(and (<= main_~z~0 1) (<= 1 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; {98684#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {98684#(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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {98665#false} assume !(~z~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {98665#false} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-28 10:11:56,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-28 10:11:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:56,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180212032] [2022-04-28 10:11:56,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180212032] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:56,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651386573] [2022-04-28 10:11:56,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:56,491 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:56,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 10:11:56,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:56,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:11:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:56,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:56,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98664#true} is VALID [2022-04-28 10:11:56,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#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); {98664#true} is VALID [2022-04-28 10:11:56,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-28 10:11:56,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-28 10:11:56,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-28 10:11:56,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98669#(= main_~y~0 0)} is VALID [2022-04-28 10:11:56,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {98669#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:56,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:56,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:56,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:56,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:56,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:56,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {98731#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {98731#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98735#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:56,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {98735#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= 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; {98739#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:11:56,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {98739#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ 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; {98743#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {98743#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {98747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98751#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:11:56,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {98751#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ 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; {98755#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {98755#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98759#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {98759#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {98665#false} assume !(~z~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {98665#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; {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {98665#false} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-28 10:11:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:56,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:57,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-28 10:11:57,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-28 10:11:57,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-28 10:11:57,391 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-28 10:11:57,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:57,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {98820#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-28 10:11:57,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {98824#(< 0 (mod (+ main_~y~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; {98820#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:57,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {98828#(< 0 (mod (+ main_~y~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; {98824#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:57,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {98832#(< 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; {98828#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:57,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {98836#(< 0 (mod (+ 4294967292 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; {98832#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:57,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {98840#(< 0 (mod (+ 4294967291 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; {98836#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:57,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {98844#(< 0 (mod (+ 4294967290 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; {98840#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:57,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {98848#(< 0 (mod (+ main_~y~0 4294967289) 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; {98844#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:57,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:57,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {98855#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:57,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {98859#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {98855#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:11:57,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {98863#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98859#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:57,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {98867#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~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; {98863#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:11:57,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {98871#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98867#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:57,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {98875#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98871#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:11:57,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {98879#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98875#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:11:57,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {98883#(or (< 0 (mod (+ main_~y~0 4294967289) 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; {98879#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:11:57,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {98664#true} ~z~0 := ~y~0; {98883#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:11:57,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {98664#true} assume !(~x~0 % 4294967296 > 0); {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#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); {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98664#true} is VALID [2022-04-28 10:11:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:11:57,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651386573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:57,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:57,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-28 10:11:57,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1283507931] [2022-04-28 10:11:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1283507931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:57,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:57,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:11:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410811169] [2022-04-28 10:11:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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 37 [2022-04-28 10:11:57,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:57,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:11:57,422 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-28 10:11:57,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:11:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:11:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:11:57,422 INFO L87 Difference]: Start difference. First operand 401 states and 549 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:12:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:02,347 INFO L93 Difference]: Finished difference Result 481 states and 634 transitions. [2022-04-28 10:12:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 10:12:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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 37 [2022-04-28 10:12:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:12:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2022-04-28 10:12:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:12:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2022-04-28 10:12:02,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 102 transitions. [2022-04-28 10:12:02,424 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-28 10:12:02,431 INFO L225 Difference]: With dead ends: 481 [2022-04-28 10:12:02,431 INFO L226 Difference]: Without dead ends: 438 [2022-04-28 10:12:02,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1190, Invalid=6820, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 10:12:02,435 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:02,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:12:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-28 10:12:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 400. [2022-04-28 10:12:04,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:04,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:04,195 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:04,195 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:04,201 INFO L93 Difference]: Finished difference Result 438 states and 587 transitions. [2022-04-28 10:12:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 587 transitions. [2022-04-28 10:12:04,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:04,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:04,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 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 438 states. [2022-04-28 10:12:04,202 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 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 438 states. [2022-04-28 10:12:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:04,208 INFO L93 Difference]: Finished difference Result 438 states and 587 transitions. [2022-04-28 10:12:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 587 transitions. [2022-04-28 10:12:04,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:04,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:04,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:04,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 544 transitions. [2022-04-28 10:12:04,215 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 544 transitions. Word has length 37 [2022-04-28 10:12:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 544 transitions. [2022-04-28 10:12:04,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:12:04,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 544 transitions. [2022-04-28 10:12:07,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 544 transitions. [2022-04-28 10:12:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:07,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:07,101 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:07,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:07,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-28 10:12:07,301 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 57 times [2022-04-28 10:12:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:07,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805449531] [2022-04-28 10:12:07,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:07,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 58 times [2022-04-28 10:12:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:07,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802453308] [2022-04-28 10:12:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {101681#(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); {101663#true} is VALID [2022-04-28 10:12:07,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-28 10:12:07,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-28 10:12:07,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:07,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {101681#(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); {101663#true} is VALID [2022-04-28 10:12:07,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-28 10:12:07,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-28 10:12:07,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-28 10:12:07,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101668#(= main_~y~0 0)} is VALID [2022-04-28 10:12:07,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {101668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:07,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:07,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:07,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:07,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:07,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:07,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:07,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:07,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:07,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {101678#(and (<= main_~z~0 7) (<= 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; {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {101679#(and (<= main_~z~0 6) (<= 6 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; {101680#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {101680#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-28 10:12:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802453308] [2022-04-28 10:12:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802453308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468138673] [2022-04-28 10:12:07,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:07,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:07,509 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:07,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 10:12:07,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:07,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:07,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:12:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:07,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101663#true} is VALID [2022-04-28 10:12:07,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#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); {101663#true} is VALID [2022-04-28 10:12:07,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-28 10:12:07,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-28 10:12:07,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-28 10:12:07,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101668#(= main_~y~0 0)} is VALID [2022-04-28 10:12:07,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {101668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:07,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:07,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:07,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:07,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:07,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:07,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:07,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:07,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:07,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {101678#(and (<= main_~z~0 7) (<= 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; {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:07,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {101679#(and (<= main_~z~0 6) (<= 6 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; {101739#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {101739#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-28 10:12:07,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-28 10:12:07,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-28 10:12:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:07,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:08,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-28 10:12:08,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-28 10:12:08,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#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; {101664#false} is VALID [2022-04-28 10:12:08,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {101845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-28 10:12:08,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {101849#(< 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; {101845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:08,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {101853#(< 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; {101849#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:08,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {101857#(< 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; {101853#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:08,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {101857#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {101868#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {101872#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101868#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:08,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {101876#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101872#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:08,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {101880#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101876#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:08,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {101884#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101880#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:08,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {101888#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101884#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:08,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {101892#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101888#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:08,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {101896#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101892#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:08,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101896#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:08,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-28 10:12:08,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-28 10:12:08,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-28 10:12:08,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#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); {101663#true} is VALID [2022-04-28 10:12:08,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101663#true} is VALID [2022-04-28 10:12:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:12:08,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468138673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:08,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:08,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:12:08,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:08,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805449531] [2022-04-28 10:12:08,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805449531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:08,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:08,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285402895] [2022-04-28 10:12:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:08,130 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 37 [2022-04-28 10:12:08,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:08,131 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-28 10:12:08,147 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-28 10:12:08,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:08,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:12:08,148 INFO L87 Difference]: Start difference. First operand 400 states and 544 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-28 10:12:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:12,675 INFO L93 Difference]: Finished difference Result 505 states and 657 transitions. [2022-04-28 10:12:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:12:12,676 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 37 [2022-04-28 10:12:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:12,676 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-28 10:12:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-28 10:12:12,676 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-28 10:12:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-28 10:12:12,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-28 10:12:12,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:12,752 INFO L225 Difference]: With dead ends: 505 [2022-04-28 10:12:12,752 INFO L226 Difference]: Without dead ends: 487 [2022-04-28 10:12:12,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:12,753 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:12,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-28 10:12:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 400. [2022-04-28 10:12:14,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:14,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,518 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,518 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,525 INFO L93 Difference]: Finished difference Result 487 states and 639 transitions. [2022-04-28 10:12:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2022-04-28 10:12:14,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 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 487 states. [2022-04-28 10:12:14,526 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 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 487 states. [2022-04-28 10:12:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:14,533 INFO L93 Difference]: Finished difference Result 487 states and 639 transitions. [2022-04-28 10:12:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2022-04-28 10:12:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:14,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:14,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 543 transitions. [2022-04-28 10:12:14,540 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 543 transitions. Word has length 37 [2022-04-28 10:12:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:14,540 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 543 transitions. [2022-04-28 10:12:14,540 INFO L496 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-28 10:12:14,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 543 transitions. [2022-04-28 10:12:16,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 543 transitions. [2022-04-28 10:12:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:16,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:16,768 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:16,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-04-28 10:12:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:16,969 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 59 times [2022-04-28 10:12:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1279139264] [2022-04-28 10:12:16,971 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:16,971 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 60 times [2022-04-28 10:12:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:16,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147024620] [2022-04-28 10:12:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:17,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {104755#(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); {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:17,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {104755#(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); {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-28 10:12:17,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104742#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {104742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:17,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:17,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104754#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:17,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {104754#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-28 10:12:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:12:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147024620] [2022-04-28 10:12:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147024620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126429023] [2022-04-28 10:12:17,145 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:17,146 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:17,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 10:12:17,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:12:17,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:17,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:12:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:17,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:17,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104737#true} is VALID [2022-04-28 10:12:17,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#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); {104737#true} is VALID [2022-04-28 10:12:17,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-28 10:12:17,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-28 10:12:17,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-28 10:12:17,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104742#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {104742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:17,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104813#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {104813#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-28 10:12:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:12:17,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:17,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#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; {104738#false} is VALID [2022-04-28 10:12:17,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {104919#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-28 10:12:17,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {104923#(< 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; {104919#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:17,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {104927#(< 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; {104923#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:17,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {104927#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:17,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:17,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {104938#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:17,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {104942#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104938#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:17,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {104946#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104942#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:17,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {104950#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104946#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:17,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {104954#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104950#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:17,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {104958#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104954#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:17,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {104962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104958#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:17,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {104966#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:17,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {104970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104966#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:17,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:17,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-28 10:12:17,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-28 10:12:17,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-28 10:12:17,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#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); {104737#true} is VALID [2022-04-28 10:12:17,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104737#true} is VALID [2022-04-28 10:12:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:12:17,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126429023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:17,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:17,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:12:17,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:17,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1279139264] [2022-04-28 10:12:17,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1279139264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:17,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:17,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324338983] [2022-04-28 10:12:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:17,853 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 37 [2022-04-28 10:12:17,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:17,853 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-28 10:12:17,869 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-28 10:12:17,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:12:17,870 INFO L87 Difference]: Start difference. First operand 400 states and 543 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-28 10:12:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:22,781 INFO L93 Difference]: Finished difference Result 526 states and 678 transitions. [2022-04-28 10:12:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:12:22,781 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 37 [2022-04-28 10:12:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:22,781 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-28 10:12:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 100 transitions. [2022-04-28 10:12:22,782 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-28 10:12:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 100 transitions. [2022-04-28 10:12:22,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 100 transitions. [2022-04-28 10:12:22,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:22,864 INFO L225 Difference]: With dead ends: 526 [2022-04-28 10:12:22,865 INFO L226 Difference]: Without dead ends: 508 [2022-04-28 10:12:22,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:22,865 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:22,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-04-28 10:12:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 400. [2022-04-28 10:12:24,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:24,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,644 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,644 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,652 INFO L93 Difference]: Finished difference Result 508 states and 660 transitions. [2022-04-28 10:12:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 660 transitions. [2022-04-28 10:12:24,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:24,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:24,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 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 508 states. [2022-04-28 10:12:24,653 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 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 508 states. [2022-04-28 10:12:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,660 INFO L93 Difference]: Finished difference Result 508 states and 660 transitions. [2022-04-28 10:12:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 660 transitions. [2022-04-28 10:12:24,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:24,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:24,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:24,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 542 transitions. [2022-04-28 10:12:24,668 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 542 transitions. Word has length 37 [2022-04-28 10:12:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:24,668 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 542 transitions. [2022-04-28 10:12:24,668 INFO L496 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-28 10:12:24,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 542 transitions. [2022-04-28 10:12:27,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 542 transitions. [2022-04-28 10:12:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:27,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:27,117 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:27,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-04-28 10:12:27,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-28 10:12:27,319 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 61 times [2022-04-28 10:12:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782198821] [2022-04-28 10:12:27,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:27,322 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 62 times [2022-04-28 10:12:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:27,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905602713] [2022-04-28 10:12:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {107909#(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); {107891#true} is VALID [2022-04-28 10:12:27,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-28 10:12:27,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-28 10:12:27,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:27,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {107909#(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); {107891#true} is VALID [2022-04-28 10:12:27,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-28 10:12:27,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-28 10:12:27,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-28 10:12:27,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {107896#(= main_~y~0 0)} is VALID [2022-04-28 10:12:27,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {107896#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:27,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:27,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:27,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:27,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:27,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:27,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:27,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:27,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:27,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:27,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:27,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {107907#(and (<= main_~z~0 10) (<= 10 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; {107908#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {107908#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-28 10:12:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:12:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905602713] [2022-04-28 10:12:27,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905602713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071106823] [2022-04-28 10:12:27,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:27,529 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:27,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 10:12:27,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:27,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:27,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:12:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:27,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107891#true} is VALID [2022-04-28 10:12:27,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#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); {107891#true} is VALID [2022-04-28 10:12:27,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-28 10:12:27,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-28 10:12:27,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-28 10:12:27,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {107896#(= main_~y~0 0)} is VALID [2022-04-28 10:12:27,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {107896#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:27,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:27,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:27,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:27,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:27,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:27,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:27,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:27,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:27,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:27,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:27,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:27,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {107907#(and (<= main_~z~0 10) (<= 10 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; {107967#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:27,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {107967#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-28 10:12:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:12:27,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#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; {107892#false} is VALID [2022-04-28 10:12:28,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {108073#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-28 10:12:28,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {108077#(< 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; {108073#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:28,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {108077#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {108088#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {108092#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108088#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:28,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {108096#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108092#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:28,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {108100#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108096#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:28,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {108104#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108100#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:28,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {108108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108104#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:28,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {108112#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {108116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108112#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:28,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {108120#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {108124#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108120#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:28,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108124#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:28,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-28 10:12:28,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-28 10:12:28,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-28 10:12:28,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#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); {107891#true} is VALID [2022-04-28 10:12:28,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107891#true} is VALID [2022-04-28 10:12:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:12:28,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071106823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:28,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:28,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:12:28,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:28,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782198821] [2022-04-28 10:12:28,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782198821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:28,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:28,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:12:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862899191] [2022-04-28 10:12:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:28,144 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 37 [2022-04-28 10:12:28,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:28,144 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-28 10:12:28,160 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-28 10:12:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:12:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:12:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:12:28,161 INFO L87 Difference]: Start difference. First operand 400 states and 542 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-28 10:12:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:33,455 INFO L93 Difference]: Finished difference Result 548 states and 700 transitions. [2022-04-28 10:12:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:12:33,455 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 37 [2022-04-28 10:12:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:33,455 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-28 10:12:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 106 transitions. [2022-04-28 10:12:33,456 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-28 10:12:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 106 transitions. [2022-04-28 10:12:33,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 106 transitions. [2022-04-28 10:12:33,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:33,545 INFO L225 Difference]: With dead ends: 548 [2022-04-28 10:12:33,545 INFO L226 Difference]: Without dead ends: 530 [2022-04-28 10:12:33,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:12:33,545 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:33,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:12:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-04-28 10:12:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 400. [2022-04-28 10:12:35,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:35,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:35,304 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:35,304 INFO L87 Difference]: Start difference. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:35,312 INFO L93 Difference]: Finished difference Result 530 states and 682 transitions. [2022-04-28 10:12:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 682 transitions. [2022-04-28 10:12:35,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:35,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:35,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 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 530 states. [2022-04-28 10:12:35,313 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 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 530 states. [2022-04-28 10:12:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:35,321 INFO L93 Difference]: Finished difference Result 530 states and 682 transitions. [2022-04-28 10:12:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 682 transitions. [2022-04-28 10:12:35,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:35,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:35,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:35,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 541 transitions. [2022-04-28 10:12:35,328 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 541 transitions. Word has length 37 [2022-04-28 10:12:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:35,328 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 541 transitions. [2022-04-28 10:12:35,328 INFO L496 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-28 10:12:35,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 541 transitions. [2022-04-28 10:12:37,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 541 transitions. [2022-04-28 10:12:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:37,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:37,713 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:37,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-28 10:12:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-28 10:12:37,914 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 43 times [2022-04-28 10:12:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:37,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241426253] [2022-04-28 10:12:37,916 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:37,916 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 44 times [2022-04-28 10:12:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854522393] [2022-04-28 10:12:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {111158#(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); {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {111158#(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); {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111134#(= main_~y~0 0)} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {111134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:38,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:38,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:38,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:38,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:38,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:38,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:38,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:38,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:38,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:38,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:38,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:38,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:38,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:38,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:38,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:38,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:38,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:38,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {111157#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {111157#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,331 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-28 10:12:38,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-28 10:12:38,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-28 10:12:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854522393] [2022-04-28 10:12:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854522393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109809307] [2022-04-28 10:12:38,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:38,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:38,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:38,333 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:38,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 10:12:38,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:38,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:38,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:12:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:38,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:38,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-28 10:12:38,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#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); {111129#true} is VALID [2022-04-28 10:12:38,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-28 10:12:38,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-28 10:12:38,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-28 10:12:38,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111134#(= main_~y~0 0)} is VALID [2022-04-28 10:12:38,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {111134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:38,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:38,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:38,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:38,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:38,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:38,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:38,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:38,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:38,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:38,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:38,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:38,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:38,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:38,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:38,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:38,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:38,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:38,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:38,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:38,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:38,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:38,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {111249#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {111249#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:38,705 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-28 10:12:38,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-28 10:12:38,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-28 10:12:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:38,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:39,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-28 10:12:39,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-28 10:12:39,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-28 10:12:39,563 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-28 10:12:39,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:39,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:39,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {111289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-28 10:12:39,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {111293#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {111289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:39,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {111293#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {111293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:39,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {111300#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:39,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {111304#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111300#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:39,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {111308#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111304#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:39,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {111312#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111308#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:39,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {111316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111312#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:39,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {111320#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:39,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {111324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111320#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:39,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {111328#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:39,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {111332#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111328#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:39,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {111336#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111332#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:39,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {111340#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111336#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:39,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {111344#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111340#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:39,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {111348#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111344#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:39,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {111352#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111348#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:39,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {111356#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111352#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:39,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {111360#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111356#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:39,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {111364#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111360#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:39,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {111368#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111364#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:39,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {111372#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111368#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:39,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {111376#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111372#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:39,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {111380#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111376#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:39,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {111384#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111380#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:39,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111384#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:12:39,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-28 10:12:39,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-28 10:12:39,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-28 10:12:39,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#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); {111129#true} is VALID [2022-04-28 10:12:39,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-28 10:12:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:39,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109809307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:39,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:39,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:12:39,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:39,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241426253] [2022-04-28 10:12:39,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241426253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:39,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:39,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:12:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037237726] [2022-04-28 10:12:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:39,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:39,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:39,597 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-28 10:12:39,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:12:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:12:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:12:39,598 INFO L87 Difference]: Start difference. First operand 400 states and 541 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:50,627 INFO L93 Difference]: Finished difference Result 702 states and 1069 transitions. [2022-04-28 10:12:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:12:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 235 transitions. [2022-04-28 10:12:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 235 transitions. [2022-04-28 10:12:50,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 235 transitions. [2022-04-28 10:12:50,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:50,821 INFO L225 Difference]: With dead ends: 702 [2022-04-28 10:12:50,821 INFO L226 Difference]: Without dead ends: 674 [2022-04-28 10:12:50,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:12:50,821 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4465 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 4588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:50,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 229 Invalid, 4588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4465 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 10:12:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-28 10:12:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 419. [2022-04-28 10:12:52,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:52,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,699 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,699 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,711 INFO L93 Difference]: Finished difference Result 674 states and 847 transitions. [2022-04-28 10:12:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 847 transitions. [2022-04-28 10:12:52,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 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 674 states. [2022-04-28 10:12:52,712 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 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 674 states. [2022-04-28 10:12:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,724 INFO L93 Difference]: Finished difference Result 674 states and 847 transitions. [2022-04-28 10:12:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 847 transitions. [2022-04-28 10:12:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:52,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 569 transitions. [2022-04-28 10:12:52,731 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 569 transitions. Word has length 37 [2022-04-28 10:12:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:52,732 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 569 transitions. [2022-04-28 10:12:52,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-28 10:12:52,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 569 transitions. [2022-04-28 10:12:55,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 569 transitions. [2022-04-28 10:12:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:55,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:55,236 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:55,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-04-28 10:12:55,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-28 10:12:55,448 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 45 times [2022-04-28 10:12:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:55,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681756030] [2022-04-28 10:12:55,450 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:55,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 46 times [2022-04-28 10:12:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957254304] [2022-04-28 10:12:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {115073#(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); {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:55,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {115073#(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); {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-28 10:12:55,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115048#(= main_~y~0 0)} is VALID [2022-04-28 10:12:55,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {115048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:55,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:55,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:55,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:55,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:55,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:55,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:55,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:55,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:55,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:55,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:55,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:55,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:55,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:55,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:55,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:55,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:55,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:55,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:55,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:55,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:55,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:55,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:55,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:55,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {115072#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:12:55,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {115072#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:55,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:55,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:55,850 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-28 10:12:55,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-28 10:12:55,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-28 10:12:55,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-28 10:12:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957254304] [2022-04-28 10:12:55,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957254304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92408292] [2022-04-28 10:12:55,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:55,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:55,852 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:55,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 10:12:55,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:55,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:55,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:12:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:56,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115043#true} is VALID [2022-04-28 10:12:56,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#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); {115043#true} is VALID [2022-04-28 10:12:56,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-28 10:12:56,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-28 10:12:56,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-28 10:12:56,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115048#(= main_~y~0 0)} is VALID [2022-04-28 10:12:56,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {115048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:56,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:56,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:56,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:56,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:56,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:56,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:56,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:56,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:56,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:56,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:56,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:56,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:56,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:56,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:56,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:56,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:56,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:56,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:56,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:56,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:56,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:56,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:56,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:56,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {115167#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:12:56,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {115167#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-28 10:12:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:56,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:57,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {115207#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-28 10:12:57,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {115211#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {115207#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:57,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {115211#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {115211#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:57,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {115218#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115211#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:57,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {115222#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115218#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:57,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {115226#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115222#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:57,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {115230#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115226#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:57,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {115234#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115230#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:57,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {115238#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115234#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:57,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {115242#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:57,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {115246#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:57,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:57,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {115254#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:57,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {115258#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:57,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {115262#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:57,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {115266#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115262#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:57,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {115270#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115266#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:57,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {115274#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115270#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:57,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {115278#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115274#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:57,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {115282#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115278#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:57,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {115286#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115282#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:57,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {115290#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115286#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:57,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {115294#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115290#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:57,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {115298#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115294#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:57,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {115302#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115298#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:57,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {115306#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115302#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:12:57,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115306#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:57,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-28 10:12:57,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-28 10:12:57,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-28 10:12:57,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#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); {115043#true} is VALID [2022-04-28 10:12:57,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115043#true} is VALID [2022-04-28 10:12:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92408292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:57,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:57,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:12:57,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:57,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681756030] [2022-04-28 10:12:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681756030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:57,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:57,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:12:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410244387] [2022-04-28 10:12:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 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 38 [2022-04-28 10:12:57,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:57,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:57,198 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-28 10:12:57,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:12:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:12:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:12:57,199 INFO L87 Difference]: Start difference. First operand 419 states and 569 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:09,044 INFO L93 Difference]: Finished difference Result 731 states and 1116 transitions. [2022-04-28 10:13:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:13:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 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 38 [2022-04-28 10:13:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2022-04-28 10:13:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2022-04-28 10:13:09,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 245 transitions. [2022-04-28 10:13:09,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:09,241 INFO L225 Difference]: With dead ends: 731 [2022-04-28 10:13:09,241 INFO L226 Difference]: Without dead ends: 703 [2022-04-28 10:13:09,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:13:09,242 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 188 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:09,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 237 Invalid, 4960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 10:13:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-04-28 10:13:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 438. [2022-04-28 10:13:11,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:11,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,191 INFO L74 IsIncluded]: Start isIncluded. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,191 INFO L87 Difference]: Start difference. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,204 INFO L93 Difference]: Finished difference Result 703 states and 886 transitions. [2022-04-28 10:13:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 886 transitions. [2022-04-28 10:13:11,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 703 states. [2022-04-28 10:13:11,205 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 703 states. [2022-04-28 10:13:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:11,218 INFO L93 Difference]: Finished difference Result 703 states and 886 transitions. [2022-04-28 10:13:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 886 transitions. [2022-04-28 10:13:11,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:11,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:11,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:11,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-28 10:13:11,227 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 38 [2022-04-28 10:13:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:11,227 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-28 10:13:11,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:11,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-28 10:13:14,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-28 10:13:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:14,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:14,778 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:14,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 10:13:14,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-04-28 10:13:14,979 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 63 times [2022-04-28 10:13:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:14,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643532135] [2022-04-28 10:13:14,982 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:14,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 64 times [2022-04-28 10:13:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:14,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194493283] [2022-04-28 10:13:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:14,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {119144#(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); {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:17,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {119144#(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); {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-28 10:13:17,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-28 10:13:17,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:13:17,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:17,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:17,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119129#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {119129#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119130#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:13:17,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {119130#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119131#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {119131#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119132#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:13:17,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {119132#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:13:17,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:13:17,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~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; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:17,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 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; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~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; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~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; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-28 10:13:17,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 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; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:17,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= 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; {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-28 10:13:17,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-28 10:13:17,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:17,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-28 10:13:17,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:17,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:17,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:17,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:17,553 INFO L272 TraceCheckUtils]: 35: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119142#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:13:17,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {119142#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {119143#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:13:17,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {119143#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {119122#false} is VALID [2022-04-28 10:13:17,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-28 10:13:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:13:17,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:17,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194493283] [2022-04-28 10:13:17,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194493283] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:17,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617331570] [2022-04-28 10:13:17,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:17,555 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:17,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-28 10:13:17,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:17,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:17,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 10:13:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:17,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:26,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119121#true} is VALID [2022-04-28 10:13:26,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#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); {119121#true} is VALID [2022-04-28 10:13:26,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-28 10:13:26,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-28 10:13:26,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-28 10:13:26,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:13:26,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:26,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:13:26,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119172#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {119172#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119176#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:13:26,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {119176#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119180#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:26,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {119180#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119184#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:13:26,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {119184#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:13:26,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} ~z~0 := ~y~0; {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:13:26,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~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; {119195#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967290)))} is VALID [2022-04-28 10:13:26,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {119195#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967290)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119199#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967291 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:13:26,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {119199#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967291 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 4) main_~n~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; {119203#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} is VALID [2022-04-28 10:13:26,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {119203#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 3) main_~n~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; {119207#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 6) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 10:13:26,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {119207#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 6) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119211#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-28 10:13:26,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {119211#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)) (<= (+ main_~x~0 1) main_~n~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; {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:26,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:26,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~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; {119222#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:26,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {119222#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0) (<= main_~y~0 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; {119226#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:26,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {119226#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~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; {119230#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {119230#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {119234#(and (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0))} is VALID [2022-04-28 10:13:26,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {119234#(and (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~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; {119238#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:26,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {119238#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 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; {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:13:26,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-28 10:13:26,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:26,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-28 10:13:26,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:26,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:26,517 INFO L272 TraceCheckUtils]: 35: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:26,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {119274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:26,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {119274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119122#false} is VALID [2022-04-28 10:13:26,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-28 10:13:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:26,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:30,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-28 10:13:30,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {119274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119122#false} is VALID [2022-04-28 10:13:30,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {119274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:30,148 INFO L272 TraceCheckUtils]: 35: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:30,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-28 10:13:30,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-28 10:13:30,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~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; {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 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; {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 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; {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-28 10:13:30,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~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; {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-28 10:13:30,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~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; {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:30,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {119365#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:30,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {119369#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119365#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 10:13:30,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {119373#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119369#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:13:30,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {119377#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119373#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:30,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {119381#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119377#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:30,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {119385#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119381#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:30,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {119389#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119385#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 10:13:30,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119389#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:30,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-28 10:13:30,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-28 10:13:30,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-28 10:13:30,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#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); {119121#true} is VALID [2022-04-28 10:13:30,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119121#true} is VALID [2022-04-28 10:13:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:13:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617331570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:30,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 18] total 53 [2022-04-28 10:13:30,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643532135] [2022-04-28 10:13:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643532135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:30,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:13:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530361642] [2022-04-28 10:13:30,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:30,172 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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 39 [2022-04-28 10:13:30,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:30,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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-28 10:13:30,436 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-28 10:13:30,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:13:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:30,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:13:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2429, Unknown=1, NotChecked=0, Total=2756 [2022-04-28 10:13:30,437 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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-28 10:13:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:34,601 INFO L93 Difference]: Finished difference Result 457 states and 616 transitions. [2022-04-28 10:13:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:13:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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 39 [2022-04-28 10:13:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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-28 10:13:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2022-04-28 10:13:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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-28 10:13:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2022-04-28 10:13:34,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 51 transitions. [2022-04-28 10:13:34,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:34,676 INFO L225 Difference]: With dead ends: 457 [2022-04-28 10:13:34,676 INFO L226 Difference]: Without dead ends: 452 [2022-04-28 10:13:34,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=485, Invalid=4484, Unknown=1, NotChecked=0, Total=4970 [2022-04-28 10:13:34,677 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:34,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:13:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-28 10:13:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2022-04-28 10:13:36,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:36,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,648 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,648 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,655 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-28 10:13:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-28 10:13:36,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 452 states. [2022-04-28 10:13:36,655 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 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 452 states. [2022-04-28 10:13:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:36,662 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-28 10:13:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-28 10:13:36,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:36,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:36,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:36,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-28 10:13:36,670 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 39 [2022-04-28 10:13:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:36,670 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-28 10:13:36,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 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-28 10:13:36,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-28 10:13:39,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-28 10:13:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:39,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:39,652 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:39,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 10:13:39,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,853 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 65 times [2022-04-28 10:13:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:39,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816050874] [2022-04-28 10:13:39,855 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:39,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 66 times [2022-04-28 10:13:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:39,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106930705] [2022-04-28 10:13:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {122159#(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); {122140#true} is VALID [2022-04-28 10:13:40,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-28 10:13:40,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-28 10:13:40,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:40,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {122159#(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); {122140#true} is VALID [2022-04-28 10:13:40,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-28 10:13:40,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-28 10:13:40,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-28 10:13:40,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122145#(= main_~y~0 0)} is VALID [2022-04-28 10:13:40,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {122145#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:40,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:40,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:40,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:40,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:40,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:40,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:40,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:40,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:40,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {122155#(and (<= main_~z~0 7) (<= 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; {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:40,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {122156#(and (<= main_~z~0 6) (<= 6 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; {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:40,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {122157#(and (<= main_~z~0 5) (<= 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; {122158#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {122158#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-28 10:13:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:13:40,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:40,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106930705] [2022-04-28 10:13:40,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106930705] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:40,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716976133] [2022-04-28 10:13:40,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:40,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:40,068 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:40,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-28 10:13:40,157 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:13:40,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:40,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:13:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:40,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122140#true} is VALID [2022-04-28 10:13:40,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#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); {122140#true} is VALID [2022-04-28 10:13:40,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-28 10:13:40,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-28 10:13:40,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-28 10:13:40,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122145#(= main_~y~0 0)} is VALID [2022-04-28 10:13:40,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {122145#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:40,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:40,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:40,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:40,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:40,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:40,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:40,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:40,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:40,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {122155#(and (<= main_~z~0 7) (<= 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; {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:40,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {122156#(and (<= main_~z~0 6) (<= 6 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; {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {122157#(and (<= main_~z~0 5) (<= 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; {122220#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {122220#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-28 10:13:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:13:40,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#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; {122141#false} is VALID [2022-04-28 10:13:40,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {122332#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-28 10:13:40,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {122336#(< 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; {122332#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:40,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {122340#(< 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; {122336#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:40,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {122344#(< 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; {122340#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:40,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {122348#(< 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; {122344#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:40,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {122348#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:40,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:40,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {122359#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:40,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {122363#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122359#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:40,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {122367#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122363#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:40,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {122371#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122367#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:40,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {122375#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:40,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {122379#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122375#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:40,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {122383#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122379#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:40,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {122387#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122383#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:40,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122387#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:40,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-28 10:13:40,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-28 10:13:40,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-28 10:13:40,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#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); {122140#true} is VALID [2022-04-28 10:13:40,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122140#true} is VALID [2022-04-28 10:13:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:13:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716976133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:40,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:13:40,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816050874] [2022-04-28 10:13:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816050874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:40,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:13:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908370117] [2022-04-28 10:13:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:40,768 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 39 [2022-04-28 10:13:40,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:40,768 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-28 10:13:40,785 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-28 10:13:40,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:13:40,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:13:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:13:40,786 INFO L87 Difference]: Start difference. First operand 438 states and 597 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-28 10:13:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:45,658 INFO L93 Difference]: Finished difference Result 530 states and 697 transitions. [2022-04-28 10:13:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:13:45,658 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 39 [2022-04-28 10:13:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:45,658 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-28 10:13:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-28 10:13:45,659 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-28 10:13:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-28 10:13:45,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 97 transitions. [2022-04-28 10:13:45,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:45,740 INFO L225 Difference]: With dead ends: 530 [2022-04-28 10:13:45,740 INFO L226 Difference]: Without dead ends: 511 [2022-04-28 10:13:45,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:13:45,741 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:45,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 95 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-28 10:13:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 438. [2022-04-28 10:13:47,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:47,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:47,721 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:47,721 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:47,729 INFO L93 Difference]: Finished difference Result 511 states and 678 transitions. [2022-04-28 10:13:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2022-04-28 10:13:47,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:47,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:47,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 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 511 states. [2022-04-28 10:13:47,730 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 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 511 states. [2022-04-28 10:13:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:47,737 INFO L93 Difference]: Finished difference Result 511 states and 678 transitions. [2022-04-28 10:13:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2022-04-28 10:13:47,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:47,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:47,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:47,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2022-04-28 10:13:47,746 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 39 [2022-04-28 10:13:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:47,746 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2022-04-28 10:13:47,746 INFO L496 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-28 10:13:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 596 transitions. [2022-04-28 10:13:50,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2022-04-28 10:13:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:50,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:50,510 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:50,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:50,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:50,710 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 29 times [2022-04-28 10:13:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:50,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643432802] [2022-04-28 10:13:50,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:50,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 30 times [2022-04-28 10:13:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:50,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647383394] [2022-04-28 10:13:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:50,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {125429#(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); {125408#true} is VALID [2022-04-28 10:13:50,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-28 10:13:50,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-28 10:13:50,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:50,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {125429#(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); {125408#true} is VALID [2022-04-28 10:13:50,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-28 10:13:50,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-28 10:13:50,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-28 10:13:50,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-28 10:13:50,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125414#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:13:50,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {125414#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125415#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {125415#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125416#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {125416#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125417#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {125417#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125418#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {125418#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125419#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:50,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {125419#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:13:50,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:13:50,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:13:50,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 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; {125421#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:13:50,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {125421#(<= (+ (* (div (+ 7 main_~x~0) 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; {125422#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {125422#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 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; {125423#(<= (+ 3 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:50,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {125423#(<= (+ 3 (* (div (+ 5 main_~x~0) 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; {125424#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:13:50,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {125424#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) 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; {125425#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) main_~x~0)} is VALID [2022-04-28 10:13:50,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {125425#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) 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; {125426#(<= (+ 6 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:50,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {125426#(<= (+ 6 (* (div (+ main_~x~0 2) 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; {125427#(<= (+ 7 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:13:50,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {125427#(<= (+ 7 (* (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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {125428#(<= (+ 8 (* 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; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:13:50,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-28 10:13:50,977 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-28 10:13:50,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-28 10:13:50,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-28 10:13:50,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-28 10:13:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:13:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647383394] [2022-04-28 10:13:50,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647383394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469706841] [2022-04-28 10:13:50,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:50,978 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:50,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-28 10:13:51,097 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:13:51,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:51,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:13:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:51,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:51,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#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); {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {125408#true} assume !(~x~0 % 4294967296 > 0); {125475#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:51,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {125475#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {125475#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 10:13:51,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {125475#(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; {125482#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:51,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {125482#(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; {125486#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:51,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {125486#(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; {125490#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:51,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {125490#(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; {125494#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {125494#(not (< 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; {125498#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {125498#(not (< 0 (mod (+ 4294967291 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; {125502#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {125502#(not (< 0 (mod (+ 4294967290 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; {125506#(not (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:51,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {125506#(not (< 0 (mod (+ main_~x~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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 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; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:13:51,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-28 10:13:51,535 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-28 10:13:51,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-28 10:13:51,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-28 10:13:51,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-28 10:13:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:13:51,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:51,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-28 10:13:51,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-28 10:13:51,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-28 10:13:51,722 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-28 10:13:51,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-28 10:13:51,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {125568#(< 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {125413#(<= main_~x~0 (+ 4294967294 (* 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; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:51,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {125605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:13:51,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {125609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {125605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:13:51,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {125613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {125617#(<= main_~x~0 (+ 4294967290 (* (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; {125613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:13:51,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {125621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:13:51,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {125625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ 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; {125621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:13:51,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:13:51,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} ~z~0 := ~y~0; {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:13:51,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {125408#true} assume !(~x~0 % 4294967296 > 0); {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:13:51,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#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); {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125408#true} is VALID [2022-04-28 10:13:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:13:51,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469706841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:51,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:51,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 36 [2022-04-28 10:13:51,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643432802] [2022-04-28 10:13:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643432802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:51,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:51,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:13:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275839755] [2022-04-28 10:13:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-28 10:13:51,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:51,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 10:13:51,757 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-28 10:13:51,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:13:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:13:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=899, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:13:51,757 INFO L87 Difference]: Start difference. First operand 438 states and 596 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 10:13:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:57,286 INFO L93 Difference]: Finished difference Result 515 states and 706 transitions. [2022-04-28 10:13:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:13:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-28 10:13:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 10:13:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-28 10:13:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 10:13:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-28 10:13:57,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 101 transitions. [2022-04-28 10:13:57,387 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-28 10:13:57,397 INFO L225 Difference]: With dead ends: 515 [2022-04-28 10:13:57,397 INFO L226 Difference]: Without dead ends: 510 [2022-04-28 10:13:57,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:13:57,397 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 102 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:57,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 51 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-28 10:13:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 481. [2022-04-28 10:13:59,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:59,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:59,665 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:59,665 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:59,673 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-28 10:13:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-28 10:13:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:59,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 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 510 states. [2022-04-28 10:13:59,674 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 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 510 states. [2022-04-28 10:13:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:59,681 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-28 10:13:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-28 10:13:59,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:59,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:59,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:59,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 657 transitions. [2022-04-28 10:13:59,691 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 657 transitions. Word has length 39 [2022-04-28 10:13:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:59,691 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 657 transitions. [2022-04-28 10:13:59,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 10:13:59,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 657 transitions. [2022-04-28 10:14:03,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 657 transitions. [2022-04-28 10:14:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:03,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:03,198 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:03,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:03,398 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 67 times [2022-04-28 10:14:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604533046] [2022-04-28 10:14:03,400 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:03,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 68 times [2022-04-28 10:14:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695085536] [2022-04-28 10:14:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {128743#(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); {128724#true} is VALID [2022-04-28 10:14:03,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-28 10:14:03,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-28 10:14:03,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:03,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {128743#(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); {128724#true} is VALID [2022-04-28 10:14:03,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-28 10:14:03,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-28 10:14:03,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-28 10:14:03,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128729#(= main_~y~0 0)} is VALID [2022-04-28 10:14:03,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {128729#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:03,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:03,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:03,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:03,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:03,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:03,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:03,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:03,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:03,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:03,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:03,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:03,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:03,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {128741#(and (<= main_~z~0 7) (<= 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; {128742#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {128742#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-28 10:14:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:03,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:03,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695085536] [2022-04-28 10:14:03,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695085536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:03,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739629571] [2022-04-28 10:14:03,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:03,612 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:03,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-28 10:14:03,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:03,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:03,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:03,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:03,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128724#true} is VALID [2022-04-28 10:14:03,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#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); {128724#true} is VALID [2022-04-28 10:14:03,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-28 10:14:03,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-28 10:14:03,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-28 10:14:03,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128729#(= main_~y~0 0)} is VALID [2022-04-28 10:14:03,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {128729#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:03,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:03,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:03,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:03,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:03,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:03,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:03,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:03,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:03,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:03,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:03,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:03,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {128741#(and (<= main_~z~0 7) (<= 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; {128804#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {128804#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-28 10:14:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:03,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:04,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-28 10:14:04,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#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; {128725#false} is VALID [2022-04-28 10:14:04,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {128916#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-28 10:14:04,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {128920#(< 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; {128916#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:04,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {128924#(< 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; {128920#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:04,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {128928#(< 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; {128924#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:04,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {128928#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:04,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:04,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {128939#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:04,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {128943#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128939#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:04,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {128947#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128943#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:04,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {128951#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128947#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:04,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {128955#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128951#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:04,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {128959#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128955#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:04,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {128963#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128959#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:04,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {128967#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128963#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:04,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {128971#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128967#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:04,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128971#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:04,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-28 10:14:04,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-28 10:14:04,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-28 10:14:04,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#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); {128724#true} is VALID [2022-04-28 10:14:04,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128724#true} is VALID [2022-04-28 10:14:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:14:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739629571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:04,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:04,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604533046] [2022-04-28 10:14:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604533046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653968731] [2022-04-28 10:14:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:04,263 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 39 [2022-04-28 10:14:04,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:04,263 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-28 10:14:04,280 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-28 10:14:04,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:04,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:04,281 INFO L87 Difference]: Start difference. First operand 481 states and 657 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-28 10:14:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:10,397 INFO L93 Difference]: Finished difference Result 612 states and 797 transitions. [2022-04-28 10:14:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:10,398 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 39 [2022-04-28 10:14:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:10,398 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-28 10:14:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-28 10:14:10,398 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-28 10:14:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-28 10:14:10,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 104 transitions. [2022-04-28 10:14:10,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:10,486 INFO L225 Difference]: With dead ends: 612 [2022-04-28 10:14:10,486 INFO L226 Difference]: Without dead ends: 593 [2022-04-28 10:14:10,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=529, Invalid=2123, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:14:10,486 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-04-28 10:14:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 481. [2022-04-28 10:14:12,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:12,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,757 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,757 INFO L87 Difference]: Start difference. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,767 INFO L93 Difference]: Finished difference Result 593 states and 778 transitions. [2022-04-28 10:14:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 778 transitions. [2022-04-28 10:14:12,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:12,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:12,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 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 593 states. [2022-04-28 10:14:12,768 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 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 593 states. [2022-04-28 10:14:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,777 INFO L93 Difference]: Finished difference Result 593 states and 778 transitions. [2022-04-28 10:14:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 778 transitions. [2022-04-28 10:14:12,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:12,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:12,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:12,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2022-04-28 10:14:12,787 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 39 [2022-04-28 10:14:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:12,787 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2022-04-28 10:14:12,787 INFO L496 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-28 10:14:12,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 656 transitions. [2022-04-28 10:14:16,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2022-04-28 10:14:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:16,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:16,130 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:16,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-28 10:14:16,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-04-28 10:14:16,346 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 69 times [2022-04-28 10:14:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:16,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898965317] [2022-04-28 10:14:16,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:16,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 70 times [2022-04-28 10:14:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:16,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378325982] [2022-04-28 10:14:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {132423#(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); {132404#true} is VALID [2022-04-28 10:14:16,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-28 10:14:16,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-28 10:14:16,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:16,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {132423#(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); {132404#true} is VALID [2022-04-28 10:14:16,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-28 10:14:16,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-28 10:14:16,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-28 10:14:16,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132409#(= main_~y~0 0)} is VALID [2022-04-28 10:14:16,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {132409#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:16,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:16,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:16,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:16,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:16,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:16,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:16,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:16,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:16,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:16,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:16,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:16,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {132420#(and (<= main_~z~0 10) (<= 10 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; {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:16,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132422#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:16,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {132422#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-28 10:14:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378325982] [2022-04-28 10:14:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378325982] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607631807] [2022-04-28 10:14:16,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:16,561 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:16,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-28 10:14:16,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:16,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:16,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:14:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:16,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132404#true} is VALID [2022-04-28 10:14:16,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#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); {132404#true} is VALID [2022-04-28 10:14:16,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-28 10:14:16,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-28 10:14:16,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-28 10:14:16,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132409#(= main_~y~0 0)} is VALID [2022-04-28 10:14:16,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {132409#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:16,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:16,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:16,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:16,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:16,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:16,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:16,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:16,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:16,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:16,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:16,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:16,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {132420#(and (<= main_~z~0 10) (<= 10 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; {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:16,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132484#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:16,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {132484#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-28 10:14:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#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; {132405#false} is VALID [2022-04-28 10:14:17,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {132596#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-28 10:14:17,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {132600#(< 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; {132596#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:17,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {132604#(< 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; {132600#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:17,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {132604#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:17,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:17,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {132615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:17,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {132619#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:17,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {132623#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132619#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:17,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {132627#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132623#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:17,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {132631#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132627#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:17,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {132635#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132631#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:17,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {132639#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132635#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:17,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {132643#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132639#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:17,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {132647#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132643#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:17,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {132651#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132647#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:17,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132651#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:17,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-28 10:14:17,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-28 10:14:17,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-28 10:14:17,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#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); {132404#true} is VALID [2022-04-28 10:14:17,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132404#true} is VALID [2022-04-28 10:14:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:14:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607631807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:17,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:17,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:14:17,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898965317] [2022-04-28 10:14:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898965317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:17,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:17,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784882179] [2022-04-28 10:14:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:17,227 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 39 [2022-04-28 10:14:17,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:17,228 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-28 10:14:17,244 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-28 10:14:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:14:17,245 INFO L87 Difference]: Start difference. First operand 481 states and 656 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-28 10:14:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,673 INFO L93 Difference]: Finished difference Result 635 states and 820 transitions. [2022-04-28 10:14:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:14:23,673 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 39 [2022-04-28 10:14:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:23,673 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-28 10:14:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 10:14:23,674 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-28 10:14:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 10:14:23,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-28 10:14:23,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:23,765 INFO L225 Difference]: With dead ends: 635 [2022-04-28 10:14:23,765 INFO L226 Difference]: Without dead ends: 616 [2022-04-28 10:14:23,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:14:23,765 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:23,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 112 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:14:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-28 10:14:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 481. [2022-04-28 10:14:26,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:26,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:26,065 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:26,065 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:26,076 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-28 10:14:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-28 10:14:26,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:26,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:26,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 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 616 states. [2022-04-28 10:14:26,077 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 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 616 states. [2022-04-28 10:14:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:26,087 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-28 10:14:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-28 10:14:26,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:26,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:26,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:26,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 655 transitions. [2022-04-28 10:14:26,097 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 655 transitions. Word has length 39 [2022-04-28 10:14:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:26,097 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 655 transitions. [2022-04-28 10:14:26,097 INFO L496 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-28 10:14:26,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 655 transitions. [2022-04-28 10:14:29,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 655 transitions. [2022-04-28 10:14:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:29,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:29,759 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:29,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:29,960 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 71 times [2022-04-28 10:14:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:29,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542186653] [2022-04-28 10:14:29,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:29,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 72 times [2022-04-28 10:14:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032241859] [2022-04-28 10:14:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:30,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {136189#(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); {136170#true} is VALID [2022-04-28 10:14:30,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:30,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {136189#(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); {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-28 10:14:30,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136175#(= main_~y~0 0)} is VALID [2022-04-28 10:14:30,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {136175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:30,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {136176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:30,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {136177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:30,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {136178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:30,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {136179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:30,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {136180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:30,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {136181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:30,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {136182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:30,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {136183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:30,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {136184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:30,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {136185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:30,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:30,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {136187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {136187#(and (<= main_~z~0 11) (<= 11 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; {136188#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {136188#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-28 10:14:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-28 10:14:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032241859] [2022-04-28 10:14:30,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032241859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863570969] [2022-04-28 10:14:30,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:30,160 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:30,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-28 10:14:30,243 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:14:30,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:30,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:14:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:30,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:30,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#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); {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {136170#true} assume !(~x~0 % 4294967296 > 0); {136170#true} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {136170#true} ~z~0 := ~y~0; {136247#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:30,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {136247#(= 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; {136251#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:14:30,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {136251#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {136255#(not (< 0 (mod (+ main_~y~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; {136259#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {136259#(not (< 0 (mod 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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-28 10:14:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:14:30,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:30,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-28 10:14:30,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-28 10:14:30,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-28 10:14:30,507 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-28 10:14:30,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#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; {136171#false} is VALID [2022-04-28 10:14:30,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {136259#(not (< 0 (mod 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; {136171#false} is VALID [2022-04-28 10:14:30,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {136255#(not (< 0 (mod (+ main_~y~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; {136259#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:30,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {136365#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {136369#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~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; {136365#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {136170#true} ~z~0 := ~y~0; {136369#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {136170#true} assume !(~x~0 % 4294967296 > 0); {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#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); {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136170#true} is VALID [2022-04-28 10:14:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:14:30,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863570969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:30,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:30,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-28 10:14:30,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542186653] [2022-04-28 10:14:30,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542186653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:30,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:30,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:14:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175475466] [2022-04-28 10:14:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:30,513 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 39 [2022-04-28 10:14:30,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:30,513 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-28 10:14:30,530 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-28 10:14:30,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:14:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:30,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:14:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:14:30,531 INFO L87 Difference]: Start difference. First operand 481 states and 655 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-28 10:14:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:37,256 INFO L93 Difference]: Finished difference Result 659 states and 844 transitions. [2022-04-28 10:14:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:14:37,256 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 39 [2022-04-28 10:14:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:37,256 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-28 10:14:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2022-04-28 10:14:37,257 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-28 10:14:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2022-04-28 10:14:37,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 115 transitions. [2022-04-28 10:14:37,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:37,355 INFO L225 Difference]: With dead ends: 659 [2022-04-28 10:14:37,355 INFO L226 Difference]: Without dead ends: 640 [2022-04-28 10:14:37,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:14:37,355 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:37,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:14:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-04-28 10:14:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 481. [2022-04-28 10:14:39,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:39,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,621 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,621 INFO L87 Difference]: Start difference. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:39,632 INFO L93 Difference]: Finished difference Result 640 states and 825 transitions. [2022-04-28 10:14:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 825 transitions. [2022-04-28 10:14:39,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:39,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:39,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 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 640 states. [2022-04-28 10:14:39,633 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 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 640 states. [2022-04-28 10:14:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:39,644 INFO L93 Difference]: Finished difference Result 640 states and 825 transitions. [2022-04-28 10:14:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 825 transitions. [2022-04-28 10:14:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:39,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:39,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:39,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 654 transitions. [2022-04-28 10:14:39,653 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 654 transitions. Word has length 39 [2022-04-28 10:14:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:39,653 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 654 transitions. [2022-04-28 10:14:39,653 INFO L496 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-28 10:14:39,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 654 transitions. [2022-04-28 10:14:43,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 654 transitions. [2022-04-28 10:14:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:14:43,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:43,165 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:43,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:43,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:43,365 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 47 times [2022-04-28 10:14:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916229110] [2022-04-28 10:14:43,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:43,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 48 times [2022-04-28 10:14:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:43,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022456481] [2022-04-28 10:14:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:43,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {140050#(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); {140019#true} is VALID [2022-04-28 10:14:43,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-28 10:14:43,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-28 10:14:43,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:43,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {140050#(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); {140019#true} is VALID [2022-04-28 10:14:43,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-28 10:14:43,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-28 10:14:43,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-28 10:14:43,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140024#(= main_~y~0 0)} is VALID [2022-04-28 10:14:43,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {140024#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:43,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:43,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:43,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:43,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:43,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:43,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:43,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:43,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:43,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:43,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:43,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:43,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:43,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:43,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:43,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:43,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:43,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:43,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:43,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:43,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:43,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:43,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:43,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:43,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:43,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {140049#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {140049#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-28 10:14:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022456481] [2022-04-28 10:14:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022456481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634610898] [2022-04-28 10:14:43,816 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:43,816 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:43,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-28 10:14:44,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 10:14:44,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:44,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:14:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:44,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:44,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140019#true} is VALID [2022-04-28 10:14:44,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#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); {140019#true} is VALID [2022-04-28 10:14:44,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-28 10:14:44,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-28 10:14:44,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-28 10:14:44,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140024#(= main_~y~0 0)} is VALID [2022-04-28 10:14:44,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {140024#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:44,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:44,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:44,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:44,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:44,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:44,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:44,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:44,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:44,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:44,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:44,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:44,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:44,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:44,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:44,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:44,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:44,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:44,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:44,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:44,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {140147#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {140147#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:44,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-28 10:14:44,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-28 10:14:44,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-28 10:14:44,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-28 10:14:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:44,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:45,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {140187#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-28 10:14:45,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {140191#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {140187#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:45,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {140191#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {140191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:45,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {140198#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:45,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {140202#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140198#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:45,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {140206#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140202#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:45,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {140210#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140206#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:45,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {140214#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140210#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:45,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {140218#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140214#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {140222#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140218#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:45,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {140226#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140222#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {140230#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140226#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:45,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {140234#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140230#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:45,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {140238#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140234#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:45,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {140242#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140238#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:45,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {140246#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140242#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:45,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {140250#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140246#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:45,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {140254#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140250#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:45,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {140258#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140254#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:45,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {140262#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140258#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:45,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {140266#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140262#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:45,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {140270#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140266#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:45,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {140274#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140270#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {140278#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140274#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:14:45,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {140282#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140278#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:14:45,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {140286#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140282#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:14:45,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {140290#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140286#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:45,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140290#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:14:45,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-28 10:14:45,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-28 10:14:45,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-28 10:14:45,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#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); {140019#true} is VALID [2022-04-28 10:14:45,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140019#true} is VALID [2022-04-28 10:14:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:45,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634610898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:45,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:45,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:14:45,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:45,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916229110] [2022-04-28 10:14:45,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916229110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:45,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:14:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216690690] [2022-04-28 10:14:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:45,746 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 10:14:45,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:45,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:45,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:45,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:14:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:14:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:14:45,767 INFO L87 Difference]: Start difference. First operand 481 states and 654 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:59,119 INFO L93 Difference]: Finished difference Result 839 states and 1283 transitions. [2022-04-28 10:14:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:14:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 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 39 [2022-04-28 10:14:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2022-04-28 10:14:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2022-04-28 10:14:59,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 255 transitions. [2022-04-28 10:14:59,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:59,345 INFO L225 Difference]: With dead ends: 839 [2022-04-28 10:14:59,345 INFO L226 Difference]: Without dead ends: 809 [2022-04-28 10:14:59,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:14:59,346 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 193 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5251 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 5388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 5251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:59,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 247 Invalid, 5388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 5251 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 10:14:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-04-28 10:15:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 502. [2022-04-28 10:15:01,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:01,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,689 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,689 INFO L87 Difference]: Start difference. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,707 INFO L93 Difference]: Finished difference Result 809 states and 1017 transitions. [2022-04-28 10:15:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1017 transitions. [2022-04-28 10:15:01,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 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 809 states. [2022-04-28 10:15:01,708 INFO L87 Difference]: Start difference. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 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 809 states. [2022-04-28 10:15:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:01,726 INFO L93 Difference]: Finished difference Result 809 states and 1017 transitions. [2022-04-28 10:15:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1017 transitions. [2022-04-28 10:15:01,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:01,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:01,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:01,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 685 transitions. [2022-04-28 10:15:01,737 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 685 transitions. Word has length 39 [2022-04-28 10:15:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:01,737 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 685 transitions. [2022-04-28 10:15:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:01,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 502 states and 685 transitions. [2022-04-28 10:15:05,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 685 transitions. [2022-04-28 10:15:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:05,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:05,416 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:05,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:05,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-28 10:15:05,617 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 73 times [2022-04-28 10:15:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:05,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475282068] [2022-04-28 10:15:05,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:05,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 74 times [2022-04-28 10:15:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:05,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821945187] [2022-04-28 10:15:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {144675#(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); {144663#true} is VALID [2022-04-28 10:15:05,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-28 10:15:05,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-28 10:15:05,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {144675#(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); {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:05,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:05,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:05,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= 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; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:05,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= 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; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= 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; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= 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; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= 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; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:05,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:05,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:05,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:05,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:05,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-28 10:15:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:05,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821945187] [2022-04-28 10:15:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821945187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:05,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785158766] [2022-04-28 10:15:05,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:05,771 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:05,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-28 10:15:05,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:05,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:05,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:15:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:05,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:06,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144663#true} is VALID [2022-04-28 10:15:06,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#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); {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= 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; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= 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; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= 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; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= 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; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= 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; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:06,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:06,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-28 10:15:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:06,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:06,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-28 10:15:06,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-28 10:15:06,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-28 10:15:06,281 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-28 10:15:06,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-28 10:15:06,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-28 10:15:06,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:06,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= 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; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= 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; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:15:06,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= 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; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= 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; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= 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; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= 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; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#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); {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144663#true} is VALID [2022-04-28 10:15:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:06,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785158766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:06,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:06,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-04-28 10:15:06,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475282068] [2022-04-28 10:15:06,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475282068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:06,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:06,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:15:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363468134] [2022-04-28 10:15:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:06,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:06,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:06,326 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-28 10:15:06,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:15:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:15:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:15:06,327 INFO L87 Difference]: Start difference. First operand 502 states and 685 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:09,952 INFO L93 Difference]: Finished difference Result 529 states and 713 transitions. [2022-04-28 10:15:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:15:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 10:15:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 10:15:09,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-28 10:15:10,001 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-28 10:15:10,010 INFO L225 Difference]: With dead ends: 529 [2022-04-28 10:15:10,010 INFO L226 Difference]: Without dead ends: 501 [2022-04-28 10:15:10,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:15:10,010 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:10,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:15:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-28 10:15:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2022-04-28 10:15:12,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:12,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,466 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,467 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,474 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-28 10:15:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-28 10:15:12,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 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 501 states. [2022-04-28 10:15:12,475 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 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 501 states. [2022-04-28 10:15:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:12,483 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-28 10:15:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-28 10:15:12,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:12,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:12,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:12,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 677 transitions. [2022-04-28 10:15:12,494 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 677 transitions. Word has length 40 [2022-04-28 10:15:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:12,494 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 677 transitions. [2022-04-28 10:15:12,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:12,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 677 transitions. [2022-04-28 10:15:16,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 677 transitions. [2022-04-28 10:15:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:16,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:16,125 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:16,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:16,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-04-28 10:15:16,335 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 31 times [2022-04-28 10:15:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929276495] [2022-04-28 10:15:16,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:16,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 32 times [2022-04-28 10:15:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343099119] [2022-04-28 10:15:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:16,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {148002#(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); {147979#true} is VALID [2022-04-28 10:15:16,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-28 10:15:16,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-28 10:15:16,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {148002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:16,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {148002#(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); {147979#true} is VALID [2022-04-28 10:15:16,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-28 10:15:16,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-28 10:15:16,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-28 10:15:16,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147984#(= main_~y~0 0)} is VALID [2022-04-28 10:15:16,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {147984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:16,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:16,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:16,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:16,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:16,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:16,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:16,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {147993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:16,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {147993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:16,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {147994#(and (<= main_~z~0 7) (<= 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; {147995#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:16,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {147995#(and (<= main_~z~0 6) (<= 6 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; {147996#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:16,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {147996#(and (<= main_~z~0 5) (<= 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; {147997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:16,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {147997#(and (<= 4 main_~z~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; {147998#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:16,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {147998#(and (<= main_~z~0 3) (<= 3 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; {147999#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:16,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {147999#(and (<= main_~z~0 2) (<= 2 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; {148000#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:16,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {148000#(and (<= main_~z~0 1) (<= 1 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; {148001#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {148001#(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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {147980#false} assume !(~z~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {147980#false} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-28 10:15:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343099119] [2022-04-28 10:15:16,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343099119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:16,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543178710] [2022-04-28 10:15:16,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:16,595 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-28 10:15:16,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:16,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:16,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 10:15:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:16,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:16,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {147979#true} is VALID [2022-04-28 10:15:16,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#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); {147979#true} is VALID [2022-04-28 10:15:16,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-28 10:15:16,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-28 10:15:16,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-28 10:15:16,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147984#(= main_~y~0 0)} is VALID [2022-04-28 10:15:16,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {147984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:16,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:16,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:16,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:16,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:16,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:16,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:16,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {148051#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {148051#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 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; {148055#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:16,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {148055#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= 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; {148059#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:16,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {148059#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 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; {148063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:15:16,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {148063#(and (<= main_~y~0 8) (<= 8 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; {148067#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {148067#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 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; {148071#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {148071#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 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; {148075#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {148075#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 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; {148079#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {148079#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 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; {148083#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {148083#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {147980#false} assume !(~z~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {147980#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; {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {147980#false} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-28 10:15:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:17,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:17,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-28 10:15:17,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-28 10:15:17,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-28 10:15:17,596 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-28 10:15:17,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:17,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {148147#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-28 10:15:17,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {148151#(< 0 (mod (+ main_~y~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; {148147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:17,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {148155#(< 0 (mod (+ main_~y~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; {148151#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:17,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {148159#(< 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; {148155#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:17,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {148163#(< 0 (mod (+ 4294967292 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; {148159#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:17,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {148167#(< 0 (mod (+ 4294967291 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; {148163#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:17,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {148171#(< 0 (mod (+ 4294967290 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; {148167#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:17,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {148175#(< 0 (mod (+ main_~y~0 4294967289) 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; {148171#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:17,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {148179#(< 0 (mod (+ 4294967288 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; {148175#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:17,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:17,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {148186#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 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; {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:17,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {148190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 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; {148186#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {148194#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 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; {148190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {148198#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 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; {148194#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {148202#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {148198#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {148206#(or (< 0 (mod (+ 4294967288 main_~y~0) 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; {148202#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {148210#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {148206#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:17,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {148214#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 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; {148210#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {148218#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {148214#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {147979#true} ~z~0 := ~y~0; {148218#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {147979#true} assume !(~x~0 % 4294967296 > 0); {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#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); {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {147979#true} is VALID [2022-04-28 10:15:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:15:17,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543178710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:17,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:17,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 48 [2022-04-28 10:15:17,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:17,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929276495] [2022-04-28 10:15:17,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929276495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:17,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:17,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:15:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599714900] [2022-04-28 10:15:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:17,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:17,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:17,629 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-28 10:15:17,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:15:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:15:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:15:17,630 INFO L87 Difference]: Start difference. First operand 495 states and 677 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:23,917 INFO L93 Difference]: Finished difference Result 593 states and 780 transitions. [2022-04-28 10:15:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 10:15:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 110 transitions. [2022-04-28 10:15:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 110 transitions. [2022-04-28 10:15:23,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 110 transitions. [2022-04-28 10:15:24,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:24,011 INFO L225 Difference]: With dead ends: 593 [2022-04-28 10:15:24,011 INFO L226 Difference]: Without dead ends: 536 [2022-04-28 10:15:24,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1488, Invalid=8814, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 10:15:24,019 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:24,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 113 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-04-28 10:15:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 494. [2022-04-28 10:15:26,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:26,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:26,493 INFO L74 IsIncluded]: Start isIncluded. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:26,493 INFO L87 Difference]: Start difference. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:26,501 INFO L93 Difference]: Finished difference Result 536 states and 718 transitions. [2022-04-28 10:15:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2022-04-28 10:15:26,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:26,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:26,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 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 536 states. [2022-04-28 10:15:26,502 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 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 536 states. [2022-04-28 10:15:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:26,511 INFO L93 Difference]: Finished difference Result 536 states and 718 transitions. [2022-04-28 10:15:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2022-04-28 10:15:26,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:26,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:26,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:26,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 671 transitions. [2022-04-28 10:15:26,521 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 671 transitions. Word has length 40 [2022-04-28 10:15:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:26,521 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 671 transitions. [2022-04-28 10:15:26,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:26,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 671 transitions. [2022-04-28 10:15:29,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 671 transitions. [2022-04-28 10:15:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:15:29,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:29,970 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:29,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:30,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:30,182 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 49 times [2022-04-28 10:15:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:30,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1316784259] [2022-04-28 10:15:30,184 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:30,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 50 times [2022-04-28 10:15:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:30,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558727984] [2022-04-28 10:15:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:30,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {151655#(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); {151623#true} is VALID [2022-04-28 10:15:30,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-28 10:15:30,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-28 10:15:30,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:30,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {151655#(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); {151623#true} is VALID [2022-04-28 10:15:30,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-28 10:15:30,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-28 10:15:30,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-28 10:15:30,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151628#(= main_~y~0 0)} is VALID [2022-04-28 10:15:30,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {151628#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:30,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:30,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:30,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:30,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:30,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:30,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:30,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:30,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:30,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:30,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:30,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:30,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:30,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:30,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:30,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:30,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:30,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:30,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:30,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:30,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:30,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:30,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:30,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:30,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:30,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:30,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {151654#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:30,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {151654#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:30,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:30,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:30,647 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-28 10:15:30,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-28 10:15:30,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-28 10:15:30,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-28 10:15:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:30,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:30,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558727984] [2022-04-28 10:15:30,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558727984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:30,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130013583] [2022-04-28 10:15:30,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:30,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:30,649 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:30,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-28 10:15:30,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:30,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:30,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:15:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:30,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:31,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151623#true} is VALID [2022-04-28 10:15:31,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#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); {151623#true} is VALID [2022-04-28 10:15:31,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-28 10:15:31,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-28 10:15:31,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-28 10:15:31,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151628#(= main_~y~0 0)} is VALID [2022-04-28 10:15:31,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {151628#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:31,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:31,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:31,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:31,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:31,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:31,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:31,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:31,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:31,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:31,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:31,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:31,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:31,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:31,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:31,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:31,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:31,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:31,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:31,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:31,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:31,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:31,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:31,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:31,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:31,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:31,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {151755#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {151755#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-28 10:15:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:31,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:32,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {151795#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-28 10:15:32,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {151799#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {151795#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:32,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {151799#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151799#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:32,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {151806#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151799#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:32,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {151810#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151806#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:32,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {151814#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151810#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:32,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {151818#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151814#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:32,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {151822#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151818#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:32,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {151826#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151822#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:32,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {151830#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151826#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:32,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {151834#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151830#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:32,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {151838#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151834#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:32,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {151842#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151838#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:32,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {151846#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151842#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:32,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {151850#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151846#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:32,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {151854#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151850#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:32,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {151858#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151854#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:32,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {151862#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151858#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:32,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {151866#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151862#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:32,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {151870#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151866#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:32,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {151874#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151870#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:32,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {151878#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151874#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:32,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {151882#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151878#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:32,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {151886#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151882#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:32,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {151890#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151886#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:32,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {151894#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151890#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:15:32,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {151898#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151894#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:32,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {151902#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151898#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:15:32,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151902#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:15:32,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-28 10:15:32,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-28 10:15:32,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-28 10:15:32,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#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); {151623#true} is VALID [2022-04-28 10:15:32,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151623#true} is VALID [2022-04-28 10:15:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:32,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130013583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:32,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:32,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 10:15:32,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1316784259] [2022-04-28 10:15:32,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1316784259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:32,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:32,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:15:32,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438407899] [2022-04-28 10:15:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:32,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:32,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:32,149 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-28 10:15:32,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:15:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:15:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:15:32,149 INFO L87 Difference]: Start difference. First operand 494 states and 671 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:46,722 INFO L93 Difference]: Finished difference Result 865 states and 1323 transitions. [2022-04-28 10:15:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:15:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:15:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2022-04-28 10:15:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2022-04-28 10:15:46,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 261 transitions. [2022-04-28 10:15:46,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:46,944 INFO L225 Difference]: With dead ends: 865 [2022-04-28 10:15:46,944 INFO L226 Difference]: Without dead ends: 834 [2022-04-28 10:15:46,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:15:46,944 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 196 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5590 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 5590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:46,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 254 Invalid, 5732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 5590 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 10:15:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-28 10:15:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 515. [2022-04-28 10:15:49,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:49,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:49,454 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:49,454 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:49,473 INFO L93 Difference]: Finished difference Result 834 states and 1047 transitions. [2022-04-28 10:15:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1047 transitions. [2022-04-28 10:15:49,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:49,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:49,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 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 834 states. [2022-04-28 10:15:49,477 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 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 834 states. [2022-04-28 10:15:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:49,496 INFO L93 Difference]: Finished difference Result 834 states and 1047 transitions. [2022-04-28 10:15:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1047 transitions. [2022-04-28 10:15:49,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:49,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:49,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:49,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 702 transitions. [2022-04-28 10:15:49,507 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 702 transitions. Word has length 40 [2022-04-28 10:15:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:49,508 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 702 transitions. [2022-04-28 10:15:49,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:49,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 702 transitions. [2022-04-28 10:15:54,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 702 transitions. [2022-04-28 10:15:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:54,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:54,928 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:54,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-04-28 10:15:55,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:55,129 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 75 times [2022-04-28 10:15:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [781851008] [2022-04-28 10:15:55,131 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:55,131 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 76 times [2022-04-28 10:15:55,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:55,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379748900] [2022-04-28 10:15:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:55,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {156425#(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); {156405#true} is VALID [2022-04-28 10:15:55,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-28 10:15:55,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-28 10:15:55,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:55,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {156425#(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); {156405#true} is VALID [2022-04-28 10:15:55,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-28 10:15:55,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-28 10:15:55,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-28 10:15:55,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156410#(= main_~y~0 0)} is VALID [2022-04-28 10:15:55,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {156410#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:55,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:55,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:55,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:55,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:55,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:55,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:55,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:55,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:55,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:55,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:55,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:55,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:55,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {156422#(and (<= main_~z~0 7) (<= 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; {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:55,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {156423#(and (<= main_~z~0 6) (<= 6 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; {156424#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {156424#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,359 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-28 10:15:55,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-28 10:15:55,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-28 10:15:55,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-28 10:15:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:15:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379748900] [2022-04-28 10:15:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379748900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247965501] [2022-04-28 10:15:55,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:55,361 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:55,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-28 10:15:55,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:55,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:55,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:15:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:55,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:55,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156405#true} is VALID [2022-04-28 10:15:55,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#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); {156405#true} is VALID [2022-04-28 10:15:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-28 10:15:55,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-28 10:15:55,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-28 10:15:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156410#(= main_~y~0 0)} is VALID [2022-04-28 10:15:55,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {156410#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:55,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:55,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:55,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:55,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:55,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:55,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:55,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:55,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:55,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:55,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:55,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:55,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:55,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {156422#(and (<= main_~z~0 7) (<= 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; {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {156423#(and (<= main_~z~0 6) (<= 6 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; {156489#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {156489#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-28 10:15:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:15:55,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#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; {156406#false} is VALID [2022-04-28 10:15:56,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {156607#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-28 10:15:56,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {156611#(< 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; {156607#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:56,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {156615#(< 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; {156611#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:56,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {156619#(< 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; {156615#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:56,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {156623#(< 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; {156619#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:56,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {156623#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:56,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:56,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {156634#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:56,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {156638#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156634#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:56,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {156642#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156638#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:56,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {156646#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156642#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:56,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {156650#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:56,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {156654#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156650#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:56,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {156658#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156654#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:56,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {156662#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156658#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:56,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {156666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156662#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:56,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:56,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-28 10:15:56,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-28 10:15:56,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-28 10:15:56,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#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); {156405#true} is VALID [2022-04-28 10:15:56,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156405#true} is VALID [2022-04-28 10:15:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:15:56,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247965501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:56,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:56,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:15:56,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:56,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [781851008] [2022-04-28 10:15:56,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [781851008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:56,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:56,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:15:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695628047] [2022-04-28 10:15:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:56,059 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:15:56,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:56,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:15:56,077 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-28 10:15:56,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:15:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:15:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:15:56,078 INFO L87 Difference]: Start difference. First operand 515 states and 702 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:02,567 INFO L93 Difference]: Finished difference Result 633 states and 829 transitions. [2022-04-28 10:16:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:16:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-28 10:16:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-28 10:16:02,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 102 transitions. [2022-04-28 10:16:02,651 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-28 10:16:02,664 INFO L225 Difference]: With dead ends: 633 [2022-04-28 10:16:02,664 INFO L226 Difference]: Without dead ends: 613 [2022-04-28 10:16:02,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:16:02,665 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:02,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:16:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-28 10:16:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 515. [2022-04-28 10:16:05,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:05,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:05,176 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:05,176 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:05,187 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-28 10:16:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-28 10:16:05,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:05,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:05,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 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 613 states. [2022-04-28 10:16:05,187 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 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 613 states. [2022-04-28 10:16:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:05,198 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-28 10:16:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-28 10:16:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:05,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:05,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 701 transitions. [2022-04-28 10:16:05,208 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 701 transitions. Word has length 41 [2022-04-28 10:16:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:05,208 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 701 transitions. [2022-04-28 10:16:05,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:05,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 701 transitions. [2022-04-28 10:16:09,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 701 transitions. [2022-04-28 10:16:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:09,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:09,097 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:09,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:09,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-04-28 10:16:09,303 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 77 times [2022-04-28 10:16:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:09,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848440746] [2022-04-28 10:16:09,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:09,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 78 times [2022-04-28 10:16:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:09,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817472590] [2022-04-28 10:16:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:09,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {160273#(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); {160253#true} is VALID [2022-04-28 10:16:09,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-28 10:16:09,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-28 10:16:09,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:09,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {160273#(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); {160253#true} is VALID [2022-04-28 10:16:09,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-28 10:16:09,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-28 10:16:09,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-28 10:16:09,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160258#(= main_~y~0 0)} is VALID [2022-04-28 10:16:09,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {160258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:09,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:09,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:09,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:09,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:09,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:09,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:09,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:09,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:09,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:09,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:09,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:09,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {160269#(and (<= main_~z~0 10) (<= 10 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; {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:09,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160272#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {160272#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-28 10:16:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817472590] [2022-04-28 10:16:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817472590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230819484] [2022-04-28 10:16:09,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:09,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:09,511 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:09,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-28 10:16:09,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:16:09,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:09,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:09,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:09,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160253#true} is VALID [2022-04-28 10:16:09,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#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); {160253#true} is VALID [2022-04-28 10:16:09,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-28 10:16:09,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-28 10:16:09,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-28 10:16:09,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160258#(= main_~y~0 0)} is VALID [2022-04-28 10:16:09,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {160258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:09,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:09,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:09,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:09,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:09,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:09,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:09,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:09,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:09,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:09,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:09,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:09,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {160269#(and (<= main_~z~0 10) (<= 10 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; {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:09,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:09,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160337#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {160337#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-28 10:16:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:09,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:10,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-28 10:16:10,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-28 10:16:10,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#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; {160254#false} is VALID [2022-04-28 10:16:10,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {160455#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-28 10:16:10,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {160459#(< 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; {160455#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:10,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {160463#(< 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; {160459#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:10,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {160467#(< 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; {160463#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:10,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {160467#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:10,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:10,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {160478#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:10,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {160482#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160478#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:10,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {160486#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160482#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:10,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {160490#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160486#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:10,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {160494#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160490#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:10,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {160498#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160494#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:10,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {160502#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160498#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:10,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {160506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160502#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:10,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {160510#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:10,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {160514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160510#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:10,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:10,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-28 10:16:10,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-28 10:16:10,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-28 10:16:10,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#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); {160253#true} is VALID [2022-04-28 10:16:10,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160253#true} is VALID [2022-04-28 10:16:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:16:10,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230819484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:10,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:10,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:10,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:10,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848440746] [2022-04-28 10:16:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848440746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:10,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:10,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161133240] [2022-04-28 10:16:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:10,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:10,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:10,400 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-28 10:16:10,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:10,400 INFO L87 Difference]: Start difference. First operand 515 states and 701 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:17,213 INFO L93 Difference]: Finished difference Result 656 states and 852 transitions. [2022-04-28 10:16:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:16:17,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-28 10:16:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-28 10:16:17,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 109 transitions. [2022-04-28 10:16:17,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:17,309 INFO L225 Difference]: With dead ends: 656 [2022-04-28 10:16:17,309 INFO L226 Difference]: Without dead ends: 636 [2022-04-28 10:16:17,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:16:17,310 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:17,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 110 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:16:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-04-28 10:16:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 515. [2022-04-28 10:16:19,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:19,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,891 INFO L74 IsIncluded]: Start isIncluded. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,891 INFO L87 Difference]: Start difference. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,903 INFO L93 Difference]: Finished difference Result 636 states and 832 transitions. [2022-04-28 10:16:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 832 transitions. [2022-04-28 10:16:19,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 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 636 states. [2022-04-28 10:16:19,907 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 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 636 states. [2022-04-28 10:16:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:19,918 INFO L93 Difference]: Finished difference Result 636 states and 832 transitions. [2022-04-28 10:16:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 832 transitions. [2022-04-28 10:16:19,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:19,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:19,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:19,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2022-04-28 10:16:19,929 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 41 [2022-04-28 10:16:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:19,930 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2022-04-28 10:16:19,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:19,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 700 transitions. [2022-04-28 10:16:24,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2022-04-28 10:16:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:24,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:24,245 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:24,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-04-28 10:16:24,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:24,446 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 79 times [2022-04-28 10:16:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:24,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388901844] [2022-04-28 10:16:24,448 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:24,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 80 times [2022-04-28 10:16:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046123617] [2022-04-28 10:16:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:24,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {164211#(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); {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:24,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {164211#(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); {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-28 10:16:24,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-28 10:16:24,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164196#(= main_~y~0 0)} is VALID [2022-04-28 10:16:24,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {164196#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:24,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:24,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:24,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:24,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:24,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:24,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:24,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:24,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:24,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:24,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:24,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:24,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:24,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {164208#(and (<= main_~z~0 11) (<= 11 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; {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:24,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {164209#(and (<= main_~z~0 10) (<= 10 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; {164210#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {164210#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:24,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,671 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-28 10:16:24,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-28 10:16:24,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-28 10:16:24,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-28 10:16:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:24,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046123617] [2022-04-28 10:16:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046123617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:24,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624342931] [2022-04-28 10:16:24,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:24,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:24,675 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:24,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-28 10:16:24,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:24,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:24,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:24,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:24,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164191#true} is VALID [2022-04-28 10:16:24,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#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); {164191#true} is VALID [2022-04-28 10:16:24,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-28 10:16:24,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-28 10:16:24,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-28 10:16:24,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164196#(= main_~y~0 0)} is VALID [2022-04-28 10:16:24,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {164196#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:24,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:24,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:24,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:24,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:24,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:24,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:24,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:24,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:24,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:24,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:24,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:24,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:24,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {164208#(and (<= main_~z~0 11) (<= 11 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; {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:24,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {164209#(and (<= main_~z~0 10) (<= 10 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; {164275#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:24,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {164275#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-28 10:16:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#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; {164192#false} is VALID [2022-04-28 10:16:25,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {164393#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-28 10:16:25,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {164397#(< 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; {164393#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:25,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {164401#(< 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; {164397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:25,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {164401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:25,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:25,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {164412#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:25,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {164416#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164412#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:25,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {164420#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164416#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:25,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {164424#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164420#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:25,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {164428#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164424#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:25,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {164432#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164428#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:25,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {164436#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164432#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:25,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {164440#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164436#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:25,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {164444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164440#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:25,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {164448#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:25,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {164452#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164448#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:25,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164452#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:25,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-28 10:16:25,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-28 10:16:25,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-28 10:16:25,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#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); {164191#true} is VALID [2022-04-28 10:16:25,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164191#true} is VALID [2022-04-28 10:16:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:25,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624342931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:25,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:25,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:25,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:25,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388901844] [2022-04-28 10:16:25,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388901844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:25,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:25,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186510139] [2022-04-28 10:16:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:25,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:25,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:25,404 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-28 10:16:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:25,405 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:33,002 INFO L93 Difference]: Finished difference Result 680 states and 876 transitions. [2022-04-28 10:16:33,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:16:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-28 10:16:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-28 10:16:33,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-28 10:16:33,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:33,107 INFO L225 Difference]: With dead ends: 680 [2022-04-28 10:16:33,107 INFO L226 Difference]: Without dead ends: 660 [2022-04-28 10:16:33,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:16:33,107 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:33,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 126 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:16:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-04-28 10:16:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 515. [2022-04-28 10:16:35,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:35,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:35,645 INFO L74 IsIncluded]: Start isIncluded. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:35,645 INFO L87 Difference]: Start difference. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:35,657 INFO L93 Difference]: Finished difference Result 660 states and 856 transitions. [2022-04-28 10:16:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 856 transitions. [2022-04-28 10:16:35,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:35,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:35,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 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 660 states. [2022-04-28 10:16:35,658 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 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 660 states. [2022-04-28 10:16:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:35,669 INFO L93 Difference]: Finished difference Result 660 states and 856 transitions. [2022-04-28 10:16:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 856 transitions. [2022-04-28 10:16:35,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:35,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:35,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:35,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 699 transitions. [2022-04-28 10:16:35,680 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 699 transitions. Word has length 41 [2022-04-28 10:16:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:35,680 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 699 transitions. [2022-04-28 10:16:35,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:35,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 699 transitions. [2022-04-28 10:16:39,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 10:16:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:39,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:39,658 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:39,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:39,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:39,859 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 81 times [2022-04-28 10:16:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1021752183] [2022-04-28 10:16:39,861 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:39,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 82 times [2022-04-28 10:16:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887104415] [2022-04-28 10:16:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {168239#(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); {168219#true} is VALID [2022-04-28 10:16:40,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-28 10:16:40,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-28 10:16:40,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:40,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {168239#(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); {168219#true} is VALID [2022-04-28 10:16:40,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-28 10:16:40,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-28 10:16:40,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-28 10:16:40,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168224#(= main_~y~0 0)} is VALID [2022-04-28 10:16:40,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {168224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:40,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:40,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:40,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:40,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:40,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:40,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:40,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:40,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:40,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:40,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:40,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:40,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:40,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {168237#(and (<= main_~z~0 12) (<= 12 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; {168238#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {168238#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-28 10:16:40,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-28 10:16:40,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-28 10:16:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887104415] [2022-04-28 10:16:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887104415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686639844] [2022-04-28 10:16:40,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:40,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:40,095 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:40,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-28 10:16:40,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:40,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:40,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:16:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:40,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:40,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168219#true} is VALID [2022-04-28 10:16:40,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#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); {168219#true} is VALID [2022-04-28 10:16:40,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-28 10:16:40,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-28 10:16:40,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-28 10:16:40,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168224#(= main_~y~0 0)} is VALID [2022-04-28 10:16:40,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {168224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:40,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:40,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:40,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:40,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:40,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:40,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:40,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:40,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:40,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:40,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:40,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:40,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:40,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:40,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {168237#(and (<= main_~z~0 12) (<= 12 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; {168303#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:40,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {168303#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-28 10:16:40,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-28 10:16:40,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-28 10:16:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:40,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:40,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-28 10:16:40,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-28 10:16:40,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-28 10:16:40,813 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#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; {168220#false} is VALID [2022-04-28 10:16:40,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {168421#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-28 10:16:40,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {168425#(< 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; {168421#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:40,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {168425#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:40,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:40,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {168436#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:40,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {168440#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168436#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:40,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {168444#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168440#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:40,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {168448#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168444#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:40,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {168452#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168448#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:40,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {168456#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168452#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:40,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {168460#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168456#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:40,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {168464#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168460#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:40,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {168468#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168464#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:40,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {168472#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168468#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:40,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {168476#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168472#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:40,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {168480#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168476#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:40,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168480#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:40,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-28 10:16:40,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-28 10:16:40,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-28 10:16:40,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#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); {168219#true} is VALID [2022-04-28 10:16:40,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168219#true} is VALID [2022-04-28 10:16:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:16:40,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686639844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:40,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:40,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:16:40,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:40,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1021752183] [2022-04-28 10:16:40,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1021752183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:40,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:40,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:16:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016611941] [2022-04-28 10:16:40,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:40,825 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:40,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:40,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:40,843 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-28 10:16:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:16:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:16:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:16:40,843 INFO L87 Difference]: Start difference. First operand 515 states and 699 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:48,418 INFO L93 Difference]: Finished difference Result 705 states and 901 transitions. [2022-04-28 10:16:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:16:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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 41 [2022-04-28 10:16:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-04-28 10:16:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-04-28 10:16:48,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 120 transitions. [2022-04-28 10:16:48,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:48,527 INFO L225 Difference]: With dead ends: 705 [2022-04-28 10:16:48,527 INFO L226 Difference]: Without dead ends: 685 [2022-04-28 10:16:48,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:16:48,527 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:48,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 125 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:16:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-04-28 10:16:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 515. [2022-04-28 10:16:51,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:51,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:51,047 INFO L74 IsIncluded]: Start isIncluded. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:51,048 INFO L87 Difference]: Start difference. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:51,060 INFO L93 Difference]: Finished difference Result 685 states and 881 transitions. [2022-04-28 10:16:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 881 transitions. [2022-04-28 10:16:51,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:51,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:51,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 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 685 states. [2022-04-28 10:16:51,061 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 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 685 states. [2022-04-28 10:16:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:51,073 INFO L93 Difference]: Finished difference Result 685 states and 881 transitions. [2022-04-28 10:16:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 881 transitions. [2022-04-28 10:16:51,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:51,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:51,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:51,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 698 transitions. [2022-04-28 10:16:51,084 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 698 transitions. Word has length 41 [2022-04-28 10:16:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:51,085 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 698 transitions. [2022-04-28 10:16:51,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 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-28 10:16:51,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 698 transitions. [2022-04-28 10:16:56,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 698 transitions. [2022-04-28 10:16:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:56,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:56,276 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:56,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:56,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-04-28 10:16:56,479 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 51 times [2022-04-28 10:16:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:56,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786556159] [2022-04-28 10:16:56,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:56,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 52 times [2022-04-28 10:16:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:56,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977658276] [2022-04-28 10:16:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:56,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {172376#(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); {172343#true} is VALID [2022-04-28 10:16:56,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-28 10:16:56,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-28 10:16:56,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:56,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {172376#(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); {172343#true} is VALID [2022-04-28 10:16:56,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-28 10:16:56,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-28 10:16:56,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-28 10:16:56,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172348#(= main_~y~0 0)} is VALID [2022-04-28 10:16:56,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {172348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:56,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:56,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:56,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:56,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:56,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:56,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:56,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:56,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:56,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:56,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:56,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:56,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:56,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:56,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:56,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:56,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:56,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:56,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:56,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:56,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:16:56,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:16:56,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:56,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:16:56,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:16:56,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:16:56,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {172375#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {172375#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-28 10:16:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:56,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977658276] [2022-04-28 10:16:56,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977658276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:56,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068313348] [2022-04-28 10:16:56,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:56,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:56,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:56,967 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:56,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-28 10:16:57,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:57,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:57,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 10:16:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:57,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:57,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172343#true} is VALID [2022-04-28 10:16:57,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#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); {172343#true} is VALID [2022-04-28 10:16:57,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-28 10:16:57,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-28 10:16:57,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-28 10:16:57,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172348#(= main_~y~0 0)} is VALID [2022-04-28 10:16:57,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {172348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:57,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:57,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:57,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:57,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:57,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:57,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:57,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:57,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:57,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:57,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:57,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:57,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:57,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:57,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:57,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:57,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:57,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:57,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:57,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:57,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:16:57,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:16:57,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:16:57,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:16:57,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:16:57,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:16:57,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {172479#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {172479#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-28 10:16:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:57,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:58,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {172519#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-28 10:16:58,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {172523#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {172519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:58,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {172523#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {172523#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:58,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {172530#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172523#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:58,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {172534#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172530#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:58,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {172538#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172534#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:58,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {172542#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172538#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:58,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {172546#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172542#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:58,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {172550#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172546#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:58,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {172554#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172550#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:58,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {172558#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172554#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:58,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {172562#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172558#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:58,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {172566#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172562#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:58,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {172570#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172566#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:58,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {172574#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172570#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:58,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {172578#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172574#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:16:58,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {172582#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172578#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:16:58,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {172586#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172582#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:16:58,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {172590#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172586#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:16:58,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {172594#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172590#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:16:58,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {172598#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172594#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:16:58,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {172602#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172598#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:16:58,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {172606#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172602#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:58,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {172610#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172606#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:16:58,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {172614#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172610#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:16:58,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {172618#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172614#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:16:58,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {172622#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172618#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:58,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {172626#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172622#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:16:58,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {172630#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172626#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:16:58,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172630#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:16:58,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-28 10:16:58,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-28 10:16:58,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-28 10:16:58,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#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); {172343#true} is VALID [2022-04-28 10:16:58,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172343#true} is VALID [2022-04-28 10:16:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:58,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068313348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:58,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:58,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 10:16:58,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786556159] [2022-04-28 10:16:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786556159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:58,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:58,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:16:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515892062] [2022-04-28 10:16:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:58,534 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:16:58,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:58,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:58,560 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-28 10:16:58,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:16:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:16:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=2692, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:16:58,561 INFO L87 Difference]: Start difference. First operand 515 states and 698 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:14,003 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2022-04-28 10:17:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:17:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:17:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 271 transitions. [2022-04-28 10:17:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 271 transitions. [2022-04-28 10:17:14,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 271 transitions. [2022-04-28 10:17:14,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:14,237 INFO L225 Difference]: With dead ends: 897 [2022-04-28 10:17:14,237 INFO L226 Difference]: Without dead ends: 866 [2022-04-28 10:17:14,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1718, Invalid=5938, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:17:14,238 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 202 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:14,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 264 Invalid, 6194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 10:17:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-04-28 10:17:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 536. [2022-04-28 10:17:16,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:16,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:16,849 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:16,850 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:16,870 INFO L93 Difference]: Finished difference Result 866 states and 1086 transitions. [2022-04-28 10:17:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2022-04-28 10:17:16,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:16,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:16,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 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 866 states. [2022-04-28 10:17:16,871 INFO L87 Difference]: Start difference. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 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 866 states. [2022-04-28 10:17:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:16,891 INFO L93 Difference]: Finished difference Result 866 states and 1086 transitions. [2022-04-28 10:17:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2022-04-28 10:17:16,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:16,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:16,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:16,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 729 transitions. [2022-04-28 10:17:16,903 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 729 transitions. Word has length 41 [2022-04-28 10:17:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:16,903 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 729 transitions. [2022-04-28 10:17:16,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:16,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 536 states and 729 transitions. [2022-04-28 10:17:21,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 729 transitions. [2022-04-28 10:17:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:21,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:21,987 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:22,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:22,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:22,188 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 33 times [2022-04-28 10:17:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:22,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821931877] [2022-04-28 10:17:22,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:22,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 34 times [2022-04-28 10:17:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556354072] [2022-04-28 10:17:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:22,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {177328#(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); {177305#true} is VALID [2022-04-28 10:17:22,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:22,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {177328#(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); {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-28 10:17:22,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-28 10:17:22,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177311#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:17:22,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {177311#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177312#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {177312#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177313#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {177313#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177314#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {177314#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177315#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {177315#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177316#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {177316#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177317#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:22,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {177317#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:22,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:22,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:22,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 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; {177319#(<= (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:17:22,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {177319#(<= (+ (* (div (+ main_~x~0 8) 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; {177320#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:17:22,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {177320#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) 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; {177321#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {177321#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 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; {177322#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:17:22,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {177322#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) 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; {177323#(<= (+ 5 (* (div (+ main_~x~0 4) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:22,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {177323#(<= (+ 5 (* (div (+ main_~x~0 4) 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; {177324#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) main_~x~0)} is VALID [2022-04-28 10:17:22,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {177324#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) 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; {177325#(<= (+ 7 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:17:22,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {177325#(<= (+ 7 (* (div (+ main_~x~0 2) 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; {177326#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) main_~x~0)} is VALID [2022-04-28 10:17:22,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {177326#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {177327#(<= (+ 9 (* 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; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:17:22,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-28 10:17:22,604 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-28 10:17:22,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-28 10:17:22,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-28 10:17:22,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-28 10:17:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:22,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556354072] [2022-04-28 10:17:22,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556354072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:22,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445483542] [2022-04-28 10:17:22,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:17:22,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:22,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:22,606 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-28 10:17:22,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:17:22,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:22,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:17:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:22,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:23,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177305#true} is VALID [2022-04-28 10:17:23,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#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); {177305#true} is VALID [2022-04-28 10:17:23,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-28 10:17:23,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-28 10:17:23,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-28 10:17:23,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-28 10:17:23,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ 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; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (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; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-28 10:17:23,056 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-28 10:17:23,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-28 10:17:23,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-28 10:17:23,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-28 10:17:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:23,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:23,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-28 10:17:23,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-28 10:17:23,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-28 10:17:23,216 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-28 10:17:23,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-28 10:17:23,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 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; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 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; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (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; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ 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; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-28 10:17:23,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-28 10:17:23,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:17:23,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:17:23,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:17:23,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:17:23,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:17:23,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:17:23,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-28 10:17:23,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-28 10:17:23,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-28 10:17:23,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-28 10:17:23,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#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); {177305#true} is VALID [2022-04-28 10:17:23,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177305#true} is VALID [2022-04-28 10:17:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:17:23,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445483542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:23,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 30 [2022-04-28 10:17:23,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:23,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821931877] [2022-04-28 10:17:23,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821931877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:23,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:23,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:17:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209734492] [2022-04-28 10:17:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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 42 [2022-04-28 10:17:23,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:23,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-28 10:17:23,258 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-28 10:17:23,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:17:23,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:17:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:17:23,258 INFO L87 Difference]: Start difference. First operand 536 states and 729 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-28 10:17:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:28,555 INFO L93 Difference]: Finished difference Result 606 states and 836 transitions. [2022-04-28 10:17:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:17:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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 42 [2022-04-28 10:17:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-28 10:17:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-28 10:17:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-28 10:17:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-28 10:17:28,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2022-04-28 10:17:28,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:28,685 INFO L225 Difference]: With dead ends: 606 [2022-04-28 10:17:28,685 INFO L226 Difference]: Without dead ends: 601 [2022-04-28 10:17:28,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=1765, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:17:28,686 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:28,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 79 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:17:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-04-28 10:17:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 584. [2022-04-28 10:17:31,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:31,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,649 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,649 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:31,659 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-28 10:17:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-28 10:17:31,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:31,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:31,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 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 601 states. [2022-04-28 10:17:31,660 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 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 601 states. [2022-04-28 10:17:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:31,670 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-28 10:17:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-28 10:17:31,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:31,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:31,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:31,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 797 transitions. [2022-04-28 10:17:31,683 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 797 transitions. Word has length 42 [2022-04-28 10:17:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:31,683 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 797 transitions. [2022-04-28 10:17:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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-28 10:17:31,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 797 transitions. [2022-04-28 10:17:36,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 797 edges. 797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 797 transitions. [2022-04-28 10:17:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:36,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:36,314 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:36,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:36,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:36,519 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 53 times [2022-04-28 10:17:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:36,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2096568302] [2022-04-28 10:17:36,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:36,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 54 times [2022-04-28 10:17:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:36,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614394532] [2022-04-28 10:17:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:37,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {181241#(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); {181207#true} is VALID [2022-04-28 10:17:37,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-28 10:17:37,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-28 10:17:37,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:37,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {181241#(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); {181207#true} is VALID [2022-04-28 10:17:37,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-28 10:17:37,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-28 10:17:37,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-28 10:17:37,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181212#(= main_~y~0 0)} is VALID [2022-04-28 10:17:37,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {181212#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:37,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:37,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:37,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:37,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:37,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:37,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:37,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:37,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:37,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:37,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:37,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:37,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:37,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:37,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:37,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:37,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:37,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:37,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:37,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:37,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:37,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:37,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:37,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:37,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:37,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:37,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:37,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:37,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {181240#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {181240#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-28 10:17:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614394532] [2022-04-28 10:17:37,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614394532] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:37,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273031694] [2022-04-28 10:17:37,036 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:37,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:37,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:37,037 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-28 10:17:38,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 10:17:38,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:38,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 10:17:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:38,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:38,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181207#true} is VALID [2022-04-28 10:17:38,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#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); {181207#true} is VALID [2022-04-28 10:17:38,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-28 10:17:38,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-28 10:17:38,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-28 10:17:38,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181212#(= main_~y~0 0)} is VALID [2022-04-28 10:17:38,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {181212#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:38,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:38,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:38,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:38,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:38,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:38,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:38,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:38,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:38,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:38,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:38,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:38,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:38,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:38,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:38,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:38,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:38,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:38,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:38,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:38,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:38,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:17:38,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:17:38,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:17:38,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:17:38,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:17:38,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:38,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:17:38,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {181347#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {181347#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-28 10:17:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:38,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:39,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-28 10:17:39,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-28 10:17:39,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-28 10:17:39,707 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-28 10:17:39,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:39,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:39,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {181387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-28 10:17:39,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {181391#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {181387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:39,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {181391#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {181391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:39,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {181398#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:39,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {181402#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181398#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:39,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {181406#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181402#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:39,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {181410#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181406#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:39,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {181414#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181410#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:39,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {181418#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181414#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:39,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {181422#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181418#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:39,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {181426#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181422#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:39,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {181430#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181426#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:39,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {181434#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181430#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:39,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {181438#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181434#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:17:39,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {181442#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181438#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:17:39,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {181446#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181442#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:17:39,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {181450#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181446#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:17:39,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {181454#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181450#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:17:39,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {181458#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181454#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:17:39,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {181462#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181458#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:17:39,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {181466#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181462#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:17:39,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {181470#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181466#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:17:39,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {181474#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181470#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:39,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {181478#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181474#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:17:39,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {181482#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181478#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:17:39,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {181486#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181482#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:17:39,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {181490#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181486#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:39,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {181494#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181490#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:17:39,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {181498#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181494#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:17:39,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {181502#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181498#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:17:39,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181502#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:17:39,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-28 10:17:39,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-28 10:17:39,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-28 10:17:39,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#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); {181207#true} is VALID [2022-04-28 10:17:39,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181207#true} is VALID [2022-04-28 10:17:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:17:39,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273031694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:39,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 10:17:39,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:39,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2096568302] [2022-04-28 10:17:39,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2096568302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:39,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 10:17:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990253749] [2022-04-28 10:17:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 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 42 [2022-04-28 10:17:39,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:39,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:39,748 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-28 10:17:39,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 10:17:39,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 10:17:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=2875, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:17:39,749 INFO L87 Difference]: Start difference. First operand 584 states and 797 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:57,254 INFO L93 Difference]: Finished difference Result 1017 states and 1561 transitions. [2022-04-28 10:17:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:17:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 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 42 [2022-04-28 10:17:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 281 transitions. [2022-04-28 10:17:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 281 transitions. [2022-04-28 10:17:57,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 281 transitions. [2022-04-28 10:17:57,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:57,501 INFO L225 Difference]: With dead ends: 1017 [2022-04-28 10:17:57,501 INFO L226 Difference]: Without dead ends: 984 [2022-04-28 10:17:57,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1837, Invalid=6353, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:17:57,501 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 217 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6524 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 6524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:57,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 274 Invalid, 6681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 6524 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 10:17:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-28 10:18:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 607. [2022-04-28 10:18:00,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:00,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:00,594 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:00,594 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:00,620 INFO L93 Difference]: Finished difference Result 984 states and 1236 transitions. [2022-04-28 10:18:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1236 transitions. [2022-04-28 10:18:00,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:00,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:00,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 984 states. [2022-04-28 10:18:00,621 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 984 states. [2022-04-28 10:18:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:00,646 INFO L93 Difference]: Finished difference Result 984 states and 1236 transitions. [2022-04-28 10:18:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1236 transitions. [2022-04-28 10:18:00,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:00,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:00,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:00,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-28 10:18:00,661 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 42 [2022-04-28 10:18:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-28 10:18:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:00,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-28 10:18:06,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-28 10:18:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:06,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:06,998 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:07,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-04-28 10:18:07,198 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 83 times [2022-04-28 10:18:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1152453571] [2022-04-28 10:18:07,201 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:07,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 84 times [2022-04-28 10:18:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:07,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772544907] [2022-04-28 10:18:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:07,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {186822#(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); {186797#true} is VALID [2022-04-28 10:18:07,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-28 10:18:07,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-28 10:18:07,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:07,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {186822#(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); {186797#true} is VALID [2022-04-28 10:18:07,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-28 10:18:07,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-28 10:18:07,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-28 10:18:07,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:18:07,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186803#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:07,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {186803#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186804#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 10:18:07,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {186804#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186805#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:18:07,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {186805#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186806#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:18:07,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {186806#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186807#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:18:07,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {186807#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186808#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:18:07,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {186808#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186809#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 10:18:07,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {186809#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:18:07,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-28 10:18:07,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:07,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} is VALID [2022-04-28 10:18:07,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 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; {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:07,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 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; {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} is VALID [2022-04-28 10:18:07,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~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; {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} is VALID [2022-04-28 10:18:07,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= 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; {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:07,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~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; {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:07,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= 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; {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} is VALID [2022-04-28 10:18:07,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} is VALID [2022-04-28 10:18:07,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:07,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:07,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} is VALID [2022-04-28 10:18:07,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} is VALID [2022-04-28 10:18:07,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:07,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} is VALID [2022-04-28 10:18:07,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:18:07,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:18:07,898 INFO L272 TraceCheckUtils]: 39: Hoare triple {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186820#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:18:07,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {186820#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {186821#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:18:07,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {186821#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186798#false} is VALID [2022-04-28 10:18:07,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-28 10:18:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:18:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772544907] [2022-04-28 10:18:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772544907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257310754] [2022-04-28 10:18:07,899 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:07,900 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:07,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-28 10:18:08,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:18:08,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:08,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-28 10:18:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:08,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:09,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186797#true} is VALID [2022-04-28 10:18:09,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#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); {186797#true} is VALID [2022-04-28 10:18:09,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-28 10:18:09,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-28 10:18:09,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-28 10:18:09,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:18:09,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186844#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:18:09,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {186844#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186848#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:09,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {186848#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186852#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-28 10:18:09,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {186852#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186856#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} is VALID [2022-04-28 10:18:09,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {186856#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186860#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 10:18:09,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {186860#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186864#(and (= main_~y~0 6) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} is VALID [2022-04-28 10:18:09,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {186864#(and (= main_~y~0 6) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186868#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:18:09,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {186868#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 6 (+ (- 1) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:18:09,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:18:09,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~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; {186879#(and (= 7 main_~y~0) (= main_~n~0 (+ main_~x~0 6)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:18:09,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {186879#(and (= 7 main_~y~0) (= main_~n~0 (+ main_~x~0 6)) (<= (mod (+ main_~x~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; {186883#(and (= main_~x~0 (+ main_~n~0 (- 5))) (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} is VALID [2022-04-28 10:18:09,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {186883#(and (= main_~x~0 (+ main_~n~0 (- 5))) (= 7 main_~y~0) (<= (mod (+ main_~n~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; {186887#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~x~0 (+ main_~n~0 (- 4))))} is VALID [2022-04-28 10:18:09,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {186887#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~x~0 (+ main_~n~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; {186891#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~n~0 (- 3)) main_~x~0))} is VALID [2022-04-28 10:18:09,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {186891#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~n~0 (- 3)) 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; {186895#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID [2022-04-28 10:18:09,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {186895#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~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; {186899#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} is VALID [2022-04-28 10:18:09,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {186899#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 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; {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !(~z~0 % 4294967296 > 0); {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) 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; {186910#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 7 (+ main_~y~0 1)))} is VALID [2022-04-28 10:18:09,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {186910#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 7 (+ 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; {186914#(and (= 7 (+ main_~y~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {186914#(and (= 7 (+ main_~y~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) 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; {186918#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 (+ main_~y~0 1)))} is VALID [2022-04-28 10:18:09,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {186918#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 (+ 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; {186922#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 4 (+ main_~y~0 1)))} is VALID [2022-04-28 10:18:09,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {186922#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 4 (+ 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; {186926#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-28 10:18:09,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {186926#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 3 (+ 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; {186930#(and (= (+ main_~y~0 2) 3) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {186930#(and (= (+ main_~y~0 2) 3) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) 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; {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !(~y~0 % 4294967296 > 0); {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-28 10:18:09,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186941#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} is VALID [2022-04-28 10:18:09,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {186941#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186945#(and (= (+ (- 1) main_~y~0) 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:18:09,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {186945#(and (= (+ (- 1) main_~y~0) 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186949#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} is VALID [2022-04-28 10:18:09,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {186949#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186953#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-28 10:18:09,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {186953#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186957#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= 5 main_~y~0))} is VALID [2022-04-28 10:18:09,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {186957#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= 5 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186961#(and (= main_~y~0 6) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} is VALID [2022-04-28 10:18:09,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {186961#(and (= main_~y~0 6) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 10:18:09,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-28 10:18:09,968 INFO L272 TraceCheckUtils]: 39: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:18:09,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186975#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:18:09,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {186975#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {186798#false} is VALID [2022-04-28 10:18:09,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-28 10:18:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:09,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:12,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-28 10:18:12,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {186975#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {186798#false} is VALID [2022-04-28 10:18:12,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186975#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:18:12,646 INFO L272 TraceCheckUtils]: 39: Hoare triple {186991#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:18:12,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {186991#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:12,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:18:12,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:18:12,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 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 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:18:12,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {187030#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 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; {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {187034#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 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; {187030#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {187038#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 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; {187034#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {187042#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 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; {187038#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {187046#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 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; {187042#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {187050#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 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; {187046#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:18:12,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod 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; {187050#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:18:12,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {187061#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967290 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; {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {187065#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (= (mod main_~n~0 4294967296) (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; {187061#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {187069#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 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; {187065#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {187073#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {187069#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {187077#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {187073#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {187081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {187077#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (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; {187081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:18:12,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 10:18:12,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 10:18:12,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:18:12,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-28 10:18:12,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:18:12,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-28 10:18:12,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-28 10:18:12,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-28 10:18:12,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#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); {186797#true} is VALID [2022-04-28 10:18:12,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186797#true} is VALID [2022-04-28 10:18:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:18:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257310754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:12,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 34, 26] total 75 [2022-04-28 10:18:12,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1152453571] [2022-04-28 10:18:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1152453571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:12,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:18:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50694623] [2022-04-28 10:18:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:12,678 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:18:12,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:12,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:12,866 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-28 10:18:12,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:18:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:18:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=4790, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 10:18:12,867 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:20,561 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2022-04-28 10:18:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:18:20,561 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:18:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2022-04-28 10:18:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2022-04-28 10:18:20,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 54 transitions. [2022-04-28 10:18:20,831 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-28 10:18:20,844 INFO L225 Difference]: With dead ends: 628 [2022-04-28 10:18:20,844 INFO L226 Difference]: Without dead ends: 623 [2022-04-28 10:18:20,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2257 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=977, Invalid=7953, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 10:18:20,845 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:20,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 108 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:18:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-04-28 10:18:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 607. [2022-04-28 10:18:24,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:24,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:24,060 INFO L74 IsIncluded]: Start isIncluded. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:24,060 INFO L87 Difference]: Start difference. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:24,072 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-28 10:18:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-28 10:18:24,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:24,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:24,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 623 states. [2022-04-28 10:18:24,073 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 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 623 states. [2022-04-28 10:18:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:24,084 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-28 10:18:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-28 10:18:24,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:24,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:24,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:24,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-28 10:18:24,100 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 43 [2022-04-28 10:18:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:24,100 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-28 10:18:24,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:24,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-28 10:18:29,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-28 10:18:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:29,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:29,993 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:29,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-04-28 10:18:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:30,195 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 85 times [2022-04-28 10:18:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:30,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000365379] [2022-04-28 10:18:30,197 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:30,197 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 86 times [2022-04-28 10:18:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:30,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932699221] [2022-04-28 10:18:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:30,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {190909#(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); {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:30,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {190909#(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); {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-28 10:18:30,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190893#(= main_~y~0 0)} is VALID [2022-04-28 10:18:30,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {190893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:30,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:30,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:30,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:30,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:30,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:30,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:30,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:30,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:30,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:30,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:30,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:30,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:30,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {190905#(and (<= main_~z~0 7) (<= 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; {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:30,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {190906#(and (<= main_~z~0 6) (<= 6 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; {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {190907#(and (<= main_~z~0 5) (<= 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; {190908#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {190908#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-28 10:18:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:30,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932699221] [2022-04-28 10:18:30,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932699221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538811147] [2022-04-28 10:18:30,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:18:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:30,438 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:30,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-28 10:18:30,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:18:30,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:30,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:18:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:30,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:30,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190888#true} is VALID [2022-04-28 10:18:30,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#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); {190888#true} is VALID [2022-04-28 10:18:30,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-28 10:18:30,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-28 10:18:30,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-28 10:18:30,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190893#(= main_~y~0 0)} is VALID [2022-04-28 10:18:30,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {190893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:30,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:30,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:30,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:30,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:30,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:30,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:30,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:30,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:30,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:30,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:30,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:30,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:30,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {190905#(and (<= main_~z~0 7) (<= 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; {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:30,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {190906#(and (<= main_~z~0 6) (<= 6 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; {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:30,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {190907#(and (<= main_~z~0 5) (<= 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; {190976#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {190976#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-28 10:18:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:30,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#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; {190889#false} is VALID [2022-04-28 10:18:31,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {191100#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-28 10:18:31,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {191104#(< 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; {191100#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:31,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {191108#(< 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; {191104#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:31,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {191112#(< 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; {191108#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:31,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {191116#(< 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; {191112#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:31,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {191120#(< 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; {191116#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:31,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {191120#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:31,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:31,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {191131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:31,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {191135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:31,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {191139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:18:31,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {191143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:18:31,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {191147#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:31,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {191151#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:31,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {191155#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:31,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {191159#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:31,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {191163#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:31,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:31,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-28 10:18:31,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-28 10:18:31,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-28 10:18:31,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#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); {190888#true} is VALID [2022-04-28 10:18:31,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190888#true} is VALID [2022-04-28 10:18:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:18:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538811147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:31,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:18:31,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000365379] [2022-04-28 10:18:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000365379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:31,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:18:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482491877] [2022-04-28 10:18:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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 43 [2022-04-28 10:18:31,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:31,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:18:31,190 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-28 10:18:31,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:18:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:18:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:18:31,191 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:18:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:39,061 INFO L93 Difference]: Finished difference Result 729 states and 962 transitions. [2022-04-28 10:18:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:18:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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 43 [2022-04-28 10:18:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:18:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 105 transitions. [2022-04-28 10:18:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:18:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 105 transitions. [2022-04-28 10:18:39,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 105 transitions. [2022-04-28 10:18:39,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:39,157 INFO L225 Difference]: With dead ends: 729 [2022-04-28 10:18:39,157 INFO L226 Difference]: Without dead ends: 708 [2022-04-28 10:18:39,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:18:39,157 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:39,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 117 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:18:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-04-28 10:18:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 607. [2022-04-28 10:18:42,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:42,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:42,377 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:42,377 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:42,391 INFO L93 Difference]: Finished difference Result 708 states and 941 transitions. [2022-04-28 10:18:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 941 transitions. [2022-04-28 10:18:42,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:42,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:42,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 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 708 states. [2022-04-28 10:18:42,392 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 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 708 states. [2022-04-28 10:18:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:42,405 INFO L93 Difference]: Finished difference Result 708 states and 941 transitions. [2022-04-28 10:18:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 941 transitions. [2022-04-28 10:18:42,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:42,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:42,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:42,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 830 transitions. [2022-04-28 10:18:42,420 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 830 transitions. Word has length 43 [2022-04-28 10:18:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:42,420 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 830 transitions. [2022-04-28 10:18:42,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-28 10:18:42,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 830 transitions. [2022-04-28 10:18:47,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 830 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 830 transitions. [2022-04-28 10:18:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:47,145 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:47,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:47,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:47,345 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 35 times [2022-04-28 10:18:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:47,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503803408] [2022-04-28 10:18:47,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:47,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 36 times [2022-04-28 10:18:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:47,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232149549] [2022-04-28 10:18:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:47,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {195347#(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); {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {195322#true} call ULTIMATE.init(); {195347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:47,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {195347#(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); {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-28 10:18:47,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {195322#true} call #t~ret13 := main(); {195322#true} is VALID [2022-04-28 10:18:47,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {195322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {195327#(= main_~y~0 0)} is VALID [2022-04-28 10:18:47,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {195327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:47,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:47,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:47,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:47,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:47,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:47,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:47,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:47,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:47,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:47,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {195337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:47,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {195337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:47,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {195338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:18:47,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {195339#(and (<= main_~z~0 7) (<= 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; {195340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:18:47,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {195340#(and (<= main_~z~0 6) (<= 6 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; {195341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:18:47,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {195341#(and (<= main_~z~0 5) (<= 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; {195342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:18:47,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {195342#(and (<= 4 main_~z~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; {195343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:18:47,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {195343#(and (<= main_~z~0 3) (<= 3 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; {195344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:18:47,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {195344#(and (<= main_~z~0 2) (<= 2 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; {195345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:18:47,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {195345#(and (<= main_~z~0 1) (<= 1 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; {195346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {195346#(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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {195323#false} assume !(~z~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {195323#false} assume !(~y~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:47,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {195323#false} assume !(~x~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:47,644 INFO L272 TraceCheckUtils]: 39: Hoare triple {195323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {195323#false} is VALID [2022-04-28 10:18:47,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {195323#false} ~cond := #in~cond; {195323#false} is VALID [2022-04-28 10:18:47,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {195323#false} assume 0 == ~cond; {195323#false} is VALID [2022-04-28 10:18:47,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {195323#false} assume !false; {195323#false} is VALID [2022-04-28 10:18:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:18:47,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:47,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232149549] [2022-04-28 10:18:47,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232149549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:47,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083353985] [2022-04-28 10:18:47,644 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:18:47,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:47,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:47,645 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:18:47,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-28 10:18:47,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:18:47,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:47,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 10:18:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:47,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:48,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {195322#true} call ULTIMATE.init(); {195322#true} is VALID [2022-04-28 10:18:48,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {195322#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); {195322#true} is VALID [2022-04-28 10:18:48,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-28 10:18:48,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-28 10:18:48,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {195322#true} call #t~ret13 := main(); {195322#true} is VALID [2022-04-28 10:18:48,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {195322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {195327#(= main_~y~0 0)} is VALID [2022-04-28 10:18:48,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {195327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:48,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:48,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:48,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:48,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:48,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:48,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:48,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:48,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {195399#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {195399#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195403#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:18:48,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {195403#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= 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; {195407#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {195407#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195411#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:18:48,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {195411#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= 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; {195415#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {195415#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195419#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {195419#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195423#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {195423#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195427#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {195427#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195431#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {195431#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195435#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {195435#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {195323#false} assume !(~z~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {195323#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; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {195323#false} assume !(~y~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {195323#false} assume !(~x~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L272 TraceCheckUtils]: 39: Hoare triple {195323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {195323#false} ~cond := #in~cond; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {195323#false} assume 0 == ~cond; {195323#false} is VALID [2022-04-28 10:18:48,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {195323#false} assume !false; {195323#false} is VALID [2022-04-28 10:18:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:18:48,234 INFO L328 TraceCheckSpWp]: Computing backward predicates...