/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:41:28,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:41:28,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:41:28,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:41:28,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:41:28,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:41:28,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:41:28,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:41:28,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:41:28,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:41:28,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:41:28,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:41:28,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:41:28,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:41:28,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:41:28,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:41:28,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:41:28,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:41:28,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:41:28,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:41:28,310 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:41:28,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:41:28,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:41:28,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:41:28,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:41:28,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:41:28,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:41:28,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:41:28,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:41:28,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:41:28,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:41:28,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:41:28,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:41:28,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:41:28,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:41:28,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:41:28,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:41:28,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:41:28,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:41:28,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:41:28,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:41:28,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:41:28,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:41:28,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:41:28,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:41:28,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:41:28,334 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:41:28,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:41:28,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:41:28,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:41:28,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:41:28,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:41:28,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:41:28,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:41:28,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:28,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:41:28,336 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:41:28,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:41:28,337 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:41:28,337 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 03:41:28,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:41:28,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:41:28,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:41:28,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:41:28,543 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:41:28,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-28 03:41:28,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b045fab/584684a2e03544148413ffab77207980/FLAG920750e00 [2022-04-28 03:41:28,920 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:41:28,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-28 03:41:28,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b045fab/584684a2e03544148413ffab77207980/FLAG920750e00 [2022-04-28 03:41:29,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b045fab/584684a2e03544148413ffab77207980 [2022-04-28 03:41:29,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:41:29,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:41:29,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:29,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:41:29,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:41:29,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c185b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29, skipping insertion in model container [2022-04-28 03:41:29,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:41:29,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:41:29,496 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-de62.c[368,381] [2022-04-28 03:41:29,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:29,532 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:41:29,551 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-de62.c[368,381] [2022-04-28 03:41:29,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:29,564 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:41:29,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29 WrapperNode [2022-04-28 03:41:29,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:29,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:41:29,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:41:29,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:41:29,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:41:29,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:41:29,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:41:29,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:41:29,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (1/1) ... [2022-04-28 03:41:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:29,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:29,619 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 03:41:29,629 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 03:41:29,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:41:29,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:41:29,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:41:29,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:41:29,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:41:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:41:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:41:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:41:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:41:29,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:41:29,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:41:29,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:41:29,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:41:29,708 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:41:29,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:41:29,931 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:41:29,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:41:29,937 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 03:41:29,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:29 BoogieIcfgContainer [2022-04-28 03:41:29,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:41:29,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:41:29,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:41:29,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:41:29,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:41:29" (1/3) ... [2022-04-28 03:41:29,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1566762a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:29, skipping insertion in model container [2022-04-28 03:41:29,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:29" (2/3) ... [2022-04-28 03:41:29,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1566762a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:29, skipping insertion in model container [2022-04-28 03:41:29,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:29" (3/3) ... [2022-04-28 03:41:29,959 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-04-28 03:41:29,968 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:41:29,968 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:41:29,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:41:30,002 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@462440d2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b6a941b [2022-04-28 03:41:30,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:41:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 03:41:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:30,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,042 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 03:41:30,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-28 03:41:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167567214] [2022-04-28 03:41:30,067 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-28 03:41:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191515925] [2022-04-28 03:41:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 03:41:30,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:41:30,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 03:41:30,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-28 03:41:30,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:41:30,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 03:41:30,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-28 03:41:30,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-28 03:41:30,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:30,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-28 03:41:30,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:30,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 03:41:30,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 03:41:30,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 03:41:30,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 03:41:30,193 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-28 03:41:30,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 03:41:30,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 03:41:30,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 03:41:30,194 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 03:41:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191515925] [2022-04-28 03:41:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191515925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:30,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167567214] [2022-04-28 03:41:30,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167567214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941068778] [2022-04-28 03:41:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,220 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 03:41:30,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:41:30,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:41:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:41:30,237 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 4.333333333333333) internal successors, (13), 2 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 03:41:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,319 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-28 03:41:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:41:30,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 03:41:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 03:41:30,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 03:41:30,408 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 03:41:30,413 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:41:30,413 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:41:30,415 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 03:41:30,417 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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 03:41:30,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:41:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:41:30,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:30,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,436 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,436 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,438 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 03:41:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:30,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:41:30,439 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:41:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,440 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 03:41:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:30,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:30,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-28 03:41:30,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-28 03:41:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:30,443 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-28 03:41:30,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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 03:41:30,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-28 03:41:30,462 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 03:41:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 03:41:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:30,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,463 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 03:41:30,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:41:30,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-28 03:41:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223734051] [2022-04-28 03:41:30,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-28 03:41:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204979684] [2022-04-28 03:41:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 03:41:30,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 03:41:30,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 03:41:30,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 03:41:30,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 03:41:30,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 03:41:30,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-28 03:41:30,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194#true} is VALID [2022-04-28 03:41:30,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:41:30,543 INFO L272 TraceCheckUtils]: 13: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:30,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {201#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:30,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-28 03:41:30,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 03:41:30,544 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 03:41:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204979684] [2022-04-28 03:41:30,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204979684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:30,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223734051] [2022-04-28 03:41:30,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223734051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816433982] [2022-04-28 03:41:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 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 03:41:30,558 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 03:41:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:30,559 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,712 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 03:41:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 03:41:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 03:41:30,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 03:41:30,759 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 03:41:30,761 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:41:30,762 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:41:30,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:30,764 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:30,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:41:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:41:30,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:30,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,777 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,777 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,778 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 03:41:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:41:30,780 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:41:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,782 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 03:41:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:30,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:30,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-28 03:41:30,786 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-04-28 03:41:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:30,786 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-28 03:41:30,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) 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 03:41:30,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-28 03:41:30,817 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 03:41:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:30,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,818 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 03:41:30,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:41:30,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-04-28 03:41:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262701208] [2022-04-28 03:41:30,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 2 times [2022-04-28 03:41:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839495559] [2022-04-28 03:41:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-28 03:41:30,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-28 03:41:30,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-28 03:41:30,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-28 03:41:30,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-28 03:41:30,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-28 03:41:30,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret17 := main(); {371#true} is VALID [2022-04-28 03:41:30,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {371#true} is VALID [2022-04-28 03:41:30,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~x~0 % 4294967296 > 0); {371#true} is VALID [2022-04-28 03:41:30,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} ~z~0 := ~y~0; {371#true} is VALID [2022-04-28 03:41:30,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !(~z~0 % 4294967296 > 0); {371#true} is VALID [2022-04-28 03:41:30,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(~y~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:30,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:30,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:30,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {372#false} is VALID [2022-04-28 03:41:30,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(~y~0 % 4294967296 > 0); {372#false} is VALID [2022-04-28 03:41:30,945 INFO L272 TraceCheckUtils]: 14: Hoare triple {372#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-28 03:41:30,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-28 03:41:30,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-28 03:41:30,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-28 03:41:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839495559] [2022-04-28 03:41:30,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839495559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:30,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262701208] [2022-04-28 03:41:30,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262701208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912985800] [2022-04-28 03:41:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:30,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,964 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 03:41:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:30,965 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,097 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-28 03:41:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:31,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-28 03:41:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-28 03:41:31,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-28 03:41:31,141 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 03:41:31,143 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:41:31,143 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:41:31,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:31,146 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:41:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:41:31,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,169 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,170 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,171 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-28 03:41:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 03:41:31,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:41:31,173 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:41:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,177 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-28 03:41:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 03:41:31,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-28 03:41:31,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2022-04-28 03:41:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,180 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-28 03:41:31,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-28 03:41:31,247 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 03:41:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 03:41:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:31,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,248 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 03:41:31,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:41:31,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-04-28 03:41:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438161282] [2022-04-28 03:41:31,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 2 times [2022-04-28 03:41:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:31,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391970800] [2022-04-28 03:41:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 03:41:31,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 03:41:31,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-28 03:41:31,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:31,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 03:41:31,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 03:41:31,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-28 03:41:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret17 := main(); {609#true} is VALID [2022-04-28 03:41:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {609#true} is VALID [2022-04-28 03:41:31,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#true} assume !(~x~0 % 4294967296 > 0); {609#true} is VALID [2022-04-28 03:41:31,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~z~0 := ~y~0; {609#true} is VALID [2022-04-28 03:41:31,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume !(~z~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:31,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:31,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:31,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {610#false} is VALID [2022-04-28 03:41:31,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume !(~z~0 % 4294967296 > 0); {610#false} is VALID [2022-04-28 03:41:31,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#false} assume !(~y~0 % 4294967296 > 0); {610#false} is VALID [2022-04-28 03:41:31,299 INFO L272 TraceCheckUtils]: 14: Hoare triple {610#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {610#false} is VALID [2022-04-28 03:41:31,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} ~cond := #in~cond; {610#false} is VALID [2022-04-28 03:41:31,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#false} assume 0 == ~cond; {610#false} is VALID [2022-04-28 03:41:31,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-04-28 03:41:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391970800] [2022-04-28 03:41:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391970800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:31,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438161282] [2022-04-28 03:41:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438161282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597426612] [2022-04-28 03:41:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:31,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:31,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,312 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 03:41:31,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:31,313 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,383 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-04-28 03:41:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:41:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:41:31,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 03:41:31,413 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 03:41:31,414 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:41:31,414 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:41:31,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:31,415 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:41:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:41:31,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,436 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,437 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,438 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-28 03:41:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 03:41:31,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:41:31,438 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:41:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,439 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-28 03:41:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 03:41:31,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 03:41:31,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 18 [2022-04-28 03:41:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,441 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-04-28 03:41:31,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 03:41:31,484 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 03:41:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 03:41:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:31,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:31,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:41:31,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 1 times [2022-04-28 03:41:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699923362] [2022-04-28 03:41:35,672 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:35,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:35,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -289672842, now seen corresponding path program 1 times [2022-04-28 03:41:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:35,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35899946] [2022-04-28 03:41:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:35,795 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,850 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-28 03:41:35,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 03:41:35,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-28 03:41:35,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:35,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-28 03:41:35,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 03:41:35,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-28 03:41:35,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret17 := main(); {866#true} is VALID [2022-04-28 03:41:35,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {871#(= main_~y~0 0)} is VALID [2022-04-28 03:41:35,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:35,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:41:35,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [98] L23-2-->L29-1_primed: Formula: (let ((.cse0 (mod v_main_~z~0_12 4294967296)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse2 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse3 (= v_main_~x~0_17 v_main_~x~0_16)) (.cse4 (= v_main_~z~0_12 v_main_~z~0_11))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_16 (+ v_main_~x~0_17 v_main_~z~0_12 (* (- 1) v_main_~z~0_11))) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse0) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_11 v_it_1 1) v_main_~z~0_12)) (< 0 (mod (+ v_main_~z~0_12 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_17, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_16, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:35,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [97] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:35,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:35,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(<= 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; {867#false} is VALID [2022-04-28 03:41:35,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume !(~x~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 03:41:35,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 03:41:35,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {867#false} is VALID [2022-04-28 03:41:35,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 03:41:35,912 INFO L272 TraceCheckUtils]: 16: Hoare triple {867#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {867#false} is VALID [2022-04-28 03:41:35,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-28 03:41:35,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-28 03:41:35,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-28 03:41:35,912 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 03:41:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35899946] [2022-04-28 03:41:35,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35899946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:35,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:35,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:35,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699923362] [2022-04-28 03:41:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699923362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:35,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:35,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945563864] [2022-04-28 03:41:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:35,951 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 20 [2022-04-28 03:41:35,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:35,951 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 03:41:35,963 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 03:41:35,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:41:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:41:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:35,964 INFO L87 Difference]: Start difference. First operand 37 states and 51 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 03:41:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,156 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 03:41:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:36,156 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 20 [2022-04-28 03:41:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:36,156 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 03:41:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 03:41:36,158 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 03:41:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 03:41:36,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-28 03:41:36,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:36,204 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:41:36,204 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:41:36,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:36,204 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:36,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:41:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:41:36,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:36,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,222 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,222 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,223 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-28 03:41:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 03:41:36,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:41:36,224 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:41:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,225 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-28 03:41:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 03:41:36,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:36,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-28 03:41:36,226 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2022-04-28 03:41:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:36,226 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-04-28 03:41:36,226 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 03:41:36,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2022-04-28 03:41:36,267 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 03:41:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 03:41:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:36,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:36,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:41:36,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-04-28 03:41:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1491291095] [2022-04-28 03:41:36,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:36,500 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash 313424023, now seen corresponding path program 1 times [2022-04-28 03:41:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004172873] [2022-04-28 03:41:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:36,512 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,528 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1112#true} is VALID [2022-04-28 03:41:36,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1112#true} assume true; {1112#true} is VALID [2022-04-28 03:41:36,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1112#true} {1112#true} #94#return; {1112#true} is VALID [2022-04-28 03:41:36,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1112#true} call ULTIMATE.init(); {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:36,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1112#true} is VALID [2022-04-28 03:41:36,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1112#true} assume true; {1112#true} is VALID [2022-04-28 03:41:36,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1112#true} {1112#true} #94#return; {1112#true} is VALID [2022-04-28 03:41:36,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {1112#true} call #t~ret17 := main(); {1112#true} is VALID [2022-04-28 03:41:36,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1112#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1112#true} is VALID [2022-04-28 03:41:36,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse4 (mod v_main_~x~0_25 4294967296)) (.cse1 (= v_main_~y~0_15 v_main_~y~0_14)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_25 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_15 v_it_2 1) v_main_~y~0_14)))) (< 0 .cse4) (= v_main_~x~0_24 (+ v_main_~x~0_25 v_main_~y~0_15 (* (- 1) v_main_~y~0_14))) (< v_main_~y~0_15 v_main_~y~0_14)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_14, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1112#true} is VALID [2022-04-28 03:41:36,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1112#true} is VALID [2022-04-28 03:41:36,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#true} ~z~0 := ~y~0; {1117#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:36,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1118#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#false} assume !(~y~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#false} assume !(~x~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {1113#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1113#false} assume !(~z~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#false} assume !(~y~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-28 03:41:36,566 INFO L272 TraceCheckUtils]: 16: Hoare triple {1113#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1113#false} is VALID [2022-04-28 03:41:36,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1113#false} ~cond := #in~cond; {1113#false} is VALID [2022-04-28 03:41:36,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {1113#false} assume 0 == ~cond; {1113#false} is VALID [2022-04-28 03:41:36,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {1113#false} assume !false; {1113#false} is VALID [2022-04-28 03:41:36,567 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 03:41:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:36,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004172873] [2022-04-28 03:41:36,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004172873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:36,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:36,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:36,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1491291095] [2022-04-28 03:41:36,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1491291095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:36,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:36,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657942411] [2022-04-28 03:41:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:36,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:36,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,603 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 03:41:36,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:36,604 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,762 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 03:41:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:41:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 03:41:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-28 03:41:36,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-28 03:41:36,795 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 03:41:36,795 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:41:36,795 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:41:36,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:36,797 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:36,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:41:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:41:36,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:36,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,817 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,817 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,818 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-28 03:41:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-28 03:41:36,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:36,819 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:41:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,820 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-28 03:41:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-28 03:41:36,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:36,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-28 03:41:36,823 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-28 03:41:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:36,823 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-28 03:41:36,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:36,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-28 03:41:36,858 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 03:41:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-28 03:41:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:36,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:36,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:41:36,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-28 03:41:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [830720591] [2022-04-28 03:41:37,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:37,078 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash 511781431, now seen corresponding path program 1 times [2022-04-28 03:41:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:37,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956987991] [2022-04-28 03:41:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:37,090 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,115 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {1340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1332#true} is VALID [2022-04-28 03:41:37,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-28 03:41:37,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-28 03:41:37,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:37,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {1340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-28 03:41:37,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1332#true} is VALID [2022-04-28 03:41:37,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:37,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1338#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:37,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {1338#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1339#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:41:37,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#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; {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {1333#false} assume !(~x~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {1333#false} assume !(~z~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {1333#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1333#false} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-28 03:41:37,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-28 03:41:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:37,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956987991] [2022-04-28 03:41:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956987991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753791425] [2022-04-28 03:41:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:37,181 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 03:41:37,216 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 03:41:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:37,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2022-04-28 03:41:37,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-28 03:41:37,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1332#true} is VALID [2022-04-28 03:41:37,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:37,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(< 0 (mod main_~y~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; {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,357 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-28 03:41:37,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-28 03:41:37,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-28 03:41:37,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-28 03:41:37,358 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 03:41:37,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:37,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-28 03:41:37,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-28 03:41:37,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-28 03:41:37,431 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-28 03:41:37,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-28 03:41:37,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(< 0 (mod main_~y~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; {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:41:37,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1439#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1439#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-28 03:41:37,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1332#true} is VALID [2022-04-28 03:41:37,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2022-04-28 03:41:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:37,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753791425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:37,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:37,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-28 03:41:37,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:37,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [830720591] [2022-04-28 03:41:37,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [830720591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:37,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:37,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357906820] [2022-04-28 03:41:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:37,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,480 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 03:41:37,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:41:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:41:37,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:37,480 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,695 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 03:41:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:37,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 03:41:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 03:41:37,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 03:41:37,725 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 03:41:37,725 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:41:37,725 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:41:37,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:41:37,726 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:37,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 40 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:41:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:41:37,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:37,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 03:41:37,741 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 03:41:37,741 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 03:41:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,742 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-28 03:41:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-28 03:41:37,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 27 states. [2022-04-28 03:41:37,743 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 27 states. [2022-04-28 03:41:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,744 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-28 03:41:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-28 03:41:37,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:37,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 03:41:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-28 03:41:37,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2022-04-28 03:41:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:37,746 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-28 03:41:37,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 03:41:37,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-28 03:41:37,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-28 03:41:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:37,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:37,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:37,819 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 03:41:38,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:38,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-28 03:41:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:38,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727811215] [2022-04-28 03:41:38,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:38,218 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1252673431, now seen corresponding path program 1 times [2022-04-28 03:41:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:38,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858739990] [2022-04-28 03:41:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:38,228 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,271 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:38,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {1666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1659#true} is VALID [2022-04-28 03:41:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-28 03:41:38,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-28 03:41:38,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1659#true} is VALID [2022-04-28 03:41:38,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-28 03:41:38,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-28 03:41:38,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-28 03:41:38,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-28 03:41:38,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-28 03:41:38,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#(<= 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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(<= (+ (* 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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-28 03:41:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:38,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:38,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858739990] [2022-04-28 03:41:38,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858739990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:38,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108484921] [2022-04-28 03:41:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:38,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:38,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:38,319 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 03:41:38,326 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 03:41:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:41:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:38,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:38,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-28 03:41:38,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1659#true} is VALID [2022-04-28 03:41:38,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-28 03:41:38,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-28 03:41:38,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-28 03:41:38,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-28 03:41:38,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-28 03:41:38,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#(<= 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; {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#(<= 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; {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-28 03:41:38,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-28 03:41:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:38,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:38,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-28 03:41:38,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-28 03:41:38,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-28 03:41:38,689 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-28 03:41:38,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-28 03:41:38,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-28 03:41:38,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(<= (+ (* 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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(<= (* (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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:41:38,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:41:38,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-28 03:41:38,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-28 03:41:38,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-28 03:41:38,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-28 03:41:38,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-28 03:41:38,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1659#true} is VALID [2022-04-28 03:41:38,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-28 03:41:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:38,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108484921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:38,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:38,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:41:38,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727811215] [2022-04-28 03:41:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727811215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:38,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:38,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191727025] [2022-04-28 03:41:38,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:38,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:38,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:38,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:38,736 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 03:41:38,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:38,737 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,001 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-28 03:41:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 03:41:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 03:41:39,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 03:41:39,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:39,060 INFO L225 Difference]: With dead ends: 55 [2022-04-28 03:41:39,060 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:41:39,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:39,061 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:39,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 32 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:41:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-04-28 03:41:39,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:39,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,093 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,093 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,095 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-28 03:41:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2022-04-28 03:41:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:39,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:39,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 03:41:39,095 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 03:41:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,097 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-28 03:41:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2022-04-28 03:41:39,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:39,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:39,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:39,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-28 03:41:39,099 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2022-04-28 03:41:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:39,099 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-28 03:41:39,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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 03:41:39,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-28 03:41:39,144 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 03:41:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:41:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:41:39,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:39,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:39,161 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 03:41:39,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 03:41:39,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-28 03:41:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287701896] [2022-04-28 03:41:39,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:39,536 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1705061574, now seen corresponding path program 1 times [2022-04-28 03:41:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293224717] [2022-04-28 03:41:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:39,547 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,560 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {2077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2070#true} is VALID [2022-04-28 03:41:39,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-28 03:41:39,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-28 03:41:39,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:39,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2070#true} is VALID [2022-04-28 03:41:39,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2070#true} is VALID [2022-04-28 03:41:39,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-28 03:41:39,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-28 03:41:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293224717] [2022-04-28 03:41:39,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293224717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146998308] [2022-04-28 03:41:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:39,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:39,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:39,594 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 03:41:39,596 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 03:41:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:39,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-28 03:41:39,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2070#true} is VALID [2022-04-28 03:41:39,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-28 03:41:39,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-28 03:41:39,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-28 03:41:39,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-28 03:41:39,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-28 03:41:39,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2070#true} is VALID [2022-04-28 03:41:39,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-28 03:41:39,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-28 03:41:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:39,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:39,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-28 03:41:39,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-28 03:41:39,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-28 03:41:39,911 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-28 03:41:39,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-28 03:41:39,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-28 03:41:39,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-28 03:41:39,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2070#true} is VALID [2022-04-28 03:41:39,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-28 03:41:39,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-28 03:41:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:39,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146998308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:39,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:39,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:41:39,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:39,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287701896] [2022-04-28 03:41:39,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287701896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:39,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:39,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175833976] [2022-04-28 03:41:39,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:39,937 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 22 [2022-04-28 03:41:39,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:39,937 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 03:41:39,948 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 03:41:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:39,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:39,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:39,948 INFO L87 Difference]: Start difference. First operand 32 states and 43 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 03:41:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:40,131 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-04-28 03:41:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:40,132 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 22 [2022-04-28 03:41:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:40,132 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 03:41:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 03:41:40,133 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 03:41:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 03:41:40,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-28 03:41:40,161 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 03:41:40,161 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:41:40,161 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:41:40,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:40,162 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:40,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:41:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-28 03:41:40,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:40,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,199 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,200 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:40,201 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 03:41:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 03:41:40,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:40,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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 03:41:40,201 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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 03:41:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:40,202 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 03:41:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 03:41:40,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:40,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:40,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:40,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-04-28 03:41:40,203 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 22 [2022-04-28 03:41:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:40,203 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-04-28 03:41:40,204 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 03:41:40,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 53 transitions. [2022-04-28 03:41:40,256 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 03:41:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-28 03:41:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:41:40,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:40,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:40,288 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 03:41:40,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:40,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-04-28 03:41:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:40,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183800038] [2022-04-28 03:41:40,617 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:40,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 806957941, now seen corresponding path program 1 times [2022-04-28 03:41:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692790945] [2022-04-28 03:41:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:40,628 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,650 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {2478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2467#true} is VALID [2022-04-28 03:41:40,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-28 03:41:40,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-28 03:41:40,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:40,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {2478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2467#true} is VALID [2022-04-28 03:41:40,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-28 03:41:40,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-28 03:41:40,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-28 03:41:40,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2472#(= main_~y~0 0)} is VALID [2022-04-28 03:41:40,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#(= main_~y~0 0)} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2473#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:41:40,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2474#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:40,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2474#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {2475#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:40,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:40,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:40,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-28 03:41:40,857 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-28 03:41:40,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-28 03:41:40,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-28 03:41:40,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-28 03:41:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692790945] [2022-04-28 03:41:40,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692790945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:40,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538911425] [2022-04-28 03:41:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:40,860 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 03:41:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,904 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 03:41:40,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:41,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2467#true} is VALID [2022-04-28 03:41:41,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {2467#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2467#true} is VALID [2022-04-28 03:41:41,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {2467#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2467#true} is VALID [2022-04-28 03:41:41,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#true} ~z~0 := ~y~0; {2506#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:41,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(= 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; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:41,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:41,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-28 03:41:41,110 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-28 03:41:41,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-28 03:41:41,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-28 03:41:41,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-28 03:41:41,110 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 03:41:41,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:41,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-28 03:41:41,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-28 03:41:41,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-28 03:41:41,325 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-28 03:41:41,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-28 03:41:41,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:41,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:41:41,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {2582#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:41:41,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#true} ~z~0 := ~y~0; {2582#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:41:41,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {2467#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2467#true} is VALID [2022-04-28 03:41:41,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {2467#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2467#true} is VALID [2022-04-28 03:41:41,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2467#true} is VALID [2022-04-28 03:41:41,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-28 03:41:41,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-28 03:41:41,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-28 03:41:41,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2467#true} is VALID [2022-04-28 03:41:41,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2467#true} is VALID [2022-04-28 03:41:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:41,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538911425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:41,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:41,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 11 [2022-04-28 03:41:41,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183800038] [2022-04-28 03:41:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183800038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:41,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215610317] [2022-04-28 03:41:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:41,712 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 22 [2022-04-28 03:41:41,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:41,713 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 03:41:41,755 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 03:41:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:41:41,756 INFO L87 Difference]: Start difference. First operand 38 states and 53 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 03:41:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,015 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-28 03:41:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:41:42,015 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 22 [2022-04-28 03:41:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:42,015 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 03:41:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-28 03:41:42,017 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 03:41:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-28 03:41:42,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-28 03:41:42,284 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 03:41:42,285 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:41:42,285 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 03:41:42,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:41:42,286 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:42,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 32 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-04-28 03:41:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 03:41:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-04-28 03:41:42,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:42,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,364 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,364 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,365 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-28 03:41:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-28 03:41:42,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:41:42,366 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:41:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:42,366 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-28 03:41:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-28 03:41:42,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:42,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:42,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:42,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-04-28 03:41:42,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 22 [2022-04-28 03:41:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:42,368 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-04-28 03:41:42,368 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 03:41:42,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 60 transitions. [2022-04-28 03:41:44,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-04-28 03:41:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:44,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:44,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:44,531 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 03:41:44,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:44,695 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-28 03:41:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538188267] [2022-04-28 03:41:44,874 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:44,876 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 965938553, now seen corresponding path program 1 times [2022-04-28 03:41:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:44,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657870767] [2022-04-28 03:41:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:44,885 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:44,910 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:45,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {2909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2900#true} is VALID [2022-04-28 03:41:45,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-28 03:41:45,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-28 03:41:45,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:45,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {2909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2900#true} is VALID [2022-04-28 03:41:45,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-28 03:41:45,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-28 03:41:45,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-28 03:41:45,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-28 03:41:45,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-28 03:41:45,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {2905#(<= 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; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {2906#(<= 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; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {2906#(<= 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; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,008 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:45,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2907#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2908#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:45,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {2908#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2901#false} is VALID [2022-04-28 03:41:45,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-28 03:41:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:45,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657870767] [2022-04-28 03:41:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657870767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:45,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783459083] [2022-04-28 03:41:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:45,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:45,011 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 03:41:45,012 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 03:41:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:45,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:45,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:45,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2022-04-28 03:41:45,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2900#true} is VALID [2022-04-28 03:41:45,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-28 03:41:45,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-28 03:41:45,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-28 03:41:45,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {2900#true} ~z~0 := ~y~0; {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#true} assume !(~z~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#true} assume !(~y~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-28 03:41:45,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2900#true} is VALID [2022-04-28 03:41:45,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#true} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,235 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:45,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:45,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2901#false} is VALID [2022-04-28 03:41:45,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-28 03:41:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:45,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:45,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-28 03:41:45,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2901#false} is VALID [2022-04-28 03:41:45,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:45,443 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:45,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#true} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#true} assume !(~y~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#true} assume !(~z~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2900#true} ~z~0 := ~y~0; {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-28 03:41:45,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-28 03:41:45,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-28 03:41:45,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-28 03:41:45,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2900#true} is VALID [2022-04-28 03:41:45,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2022-04-28 03:41:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783459083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:45,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:41:45,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538188267] [2022-04-28 03:41:45,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538188267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:45,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:45,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482403287] [2022-04-28 03:41:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:45,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,516 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 03:41:45,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:45,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:45,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:45,517 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,825 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-04-28 03:41:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 03:41:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 03:41:45,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-28 03:41:45,863 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 03:41:45,864 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:41:45,864 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:41:45,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:41:45,864 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:45,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:41:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-04-28 03:41:45,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:45,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,970 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,970 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,971 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-28 03:41:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-28 03:41:45,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:41:45,972 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:41:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,974 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-28 03:41:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-28 03:41:45,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:45,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2022-04-28 03:41:45,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 23 [2022-04-28 03:41:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:45,976 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2022-04-28 03:41:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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 03:41:45,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 78 transitions. [2022-04-28 03:41:48,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2022-04-28 03:41:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:48,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:48,131 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:48,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:41:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 03:41:48,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-04-28 03:41:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:48,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1911800177] [2022-04-28 03:41:50,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:50,513 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1110622935, now seen corresponding path program 1 times [2022-04-28 03:41:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408744500] [2022-04-28 03:41:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:50,524 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,543 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3462#true} is VALID [2022-04-28 03:41:50,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-28 03:41:50,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-28 03:41:50,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:50,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3462#true} is VALID [2022-04-28 03:41:50,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-28 03:41:50,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3462#true} is VALID [2022-04-28 03:41:50,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3462#true} is VALID [2022-04-28 03:41:50,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {3462#true} assume !(~z~0 % 4294967296 > 0); {3467#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:41:50,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {3467#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3468#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:50,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {3468#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:41:50,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:41:50,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:41:50,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {3463#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-28 03:41:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:50,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408744500] [2022-04-28 03:41:50,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408744500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:50,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048470685] [2022-04-28 03:41:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:50,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:50,618 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 03:41:50,655 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 03:41:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:41:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:50,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-28 03:41:50,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3462#true} is VALID [2022-04-28 03:41:50,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3498#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:50,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {3498#(= 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; {3502#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:41:50,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {3502#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:50,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(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; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#(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; {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:41:50,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:41:50,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {3514#(not (< 0 (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; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-28 03:41:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:50,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:50,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-28 03:41:50,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-28 03:41:50,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-28 03:41:50,904 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-28 03:41:50,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-28 03:41:50,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-28 03:41:50,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {3514#(not (< 0 (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; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:41:50,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#(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; {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:41:50,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(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; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:50,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {3581#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:50,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {3585#(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; {3581#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:41:50,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3585#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:41:50,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3462#true} is VALID [2022-04-28 03:41:50,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3462#true} is VALID [2022-04-28 03:41:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:50,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048470685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:50,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:50,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-04-28 03:41:50,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1911800177] [2022-04-28 03:41:50,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1911800177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:50,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:50,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041352903] [2022-04-28 03:41:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:50,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:50,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:50,982 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 03:41:50,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:41:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:41:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:41:50,983 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,516 INFO L93 Difference]: Finished difference Result 82 states and 120 transitions. [2022-04-28 03:41:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:41:51,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 03:41:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-28 03:41:51,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-28 03:41:51,573 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 03:41:51,574 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:41:51,574 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:41:51,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:41:51,575 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:51,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:41:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-04-28 03:41:51,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:51,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:51,746 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:51,746 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,747 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-04-28 03:41:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-04-28 03:41:51,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:51,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:51,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:41:51,751 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:41:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,753 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-04-28 03:41:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-04-28 03:41:51,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:51,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:51,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:51,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2022-04-28 03:41:51,755 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 23 [2022-04-28 03:41:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:51,755 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2022-04-28 03:41:51,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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 03:41:51,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 99 transitions. [2022-04-28 03:41:52,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2022-04-28 03:41:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:52,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:52,046 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:52,066 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 03:41:52,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:52,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1015896408, now seen corresponding path program 2 times [2022-04-28 03:41:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:52,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759263655] [2022-04-28 03:41:56,357 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:56,442 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:56,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1411894871, now seen corresponding path program 1 times [2022-04-28 03:41:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:56,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071538092] [2022-04-28 03:41:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:56,453 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:56,464 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:56,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {4084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4075#true} is VALID [2022-04-28 03:41:56,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-28 03:41:56,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:56,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {4084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-28 03:41:56,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4075#true} is VALID [2022-04-28 03:41:56,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:56,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:56,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-28 03:41:56,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-28 03:41:56,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-28 03:41:56,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-28 03:41:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071538092] [2022-04-28 03:41:56,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071538092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119025923] [2022-04-28 03:41:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:56,553 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 03:41:56,554 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 03:41:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:56,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:56,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:56,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-28 03:41:56,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4075#true} is VALID [2022-04-28 03:41:56,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:56,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:56,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:56,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-28 03:41:56,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-28 03:41:56,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-28 03:41:56,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-28 03:41:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:56,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-28 03:41:57,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:57,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-28 03:41:57,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:57,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:57,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:57,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {4190#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:57,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4190#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:41:57,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4194#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:57,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4075#true} is VALID [2022-04-28 03:41:57,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-28 03:41:57,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-28 03:41:57,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-28 03:41:57,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-28 03:41:57,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-28 03:41:57,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4075#true} is VALID [2022-04-28 03:41:57,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2022-04-28 03:41:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:57,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119025923] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:57,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:57,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:41:57,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759263655] [2022-04-28 03:41:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759263655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:57,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:41:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838762218] [2022-04-28 03:41:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:57,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:57,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,246 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 03:41:57,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:41:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:57,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:41:57,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:57,247 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:57,756 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2022-04-28 03:41:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:41:57,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 03:41:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 03:41:57,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 03:41:57,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:57,802 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:41:57,802 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:41:57,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:41:57,803 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:57,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:41:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-28 03:41:57,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:57,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:57,956 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:57,956 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:57,957 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-28 03:41:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-28 03:41:57,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:57,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:57,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 03:41:57,958 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 03:41:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:57,959 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-28 03:41:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-28 03:41:57,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:57,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:57,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:57,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2022-04-28 03:41:57,960 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 23 [2022-04-28 03:41:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:57,960 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2022-04-28 03:41:57,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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 03:41:57,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 86 transitions. [2022-04-28 03:42:00,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2022-04-28 03:42:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:42:00,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:00,161 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:00,177 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 03:42:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:00,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1947718100, now seen corresponding path program 2 times [2022-04-28 03:42:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:00,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1152225083] [2022-04-28 03:42:02,467 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:02,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:02,542 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2051243253, now seen corresponding path program 1 times [2022-04-28 03:42:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:02,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291210650] [2022-04-28 03:42:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:02,552 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,560 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4651#true} is VALID [2022-04-28 03:42:02,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-28 03:42:02,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:02,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-28 03:42:02,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4651#true} is VALID [2022-04-28 03:42:02,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:02,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:02,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {4657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4658#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:42:02,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {4658#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~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; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-28 03:42:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:02,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291210650] [2022-04-28 03:42:02,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291210650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:02,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798915904] [2022-04-28 03:42:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:02,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:02,637 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 03:42:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,676 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 03:42:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:02,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4651#true} is VALID [2022-04-28 03:42:02,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4651#true} is VALID [2022-04-28 03:42:02,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-28 03:42:02,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-28 03:42:02,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {4651#true} assume !(~z~0 % 4294967296 > 0); {4651#true} is VALID [2022-04-28 03:42:02,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4651#true} is VALID [2022-04-28 03:42:02,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#true} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~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; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-28 03:42:02,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-28 03:42:02,889 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-28 03:42:02,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-28 03:42:02,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-28 03:42:02,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-28 03:42:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:02,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:02,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-28 03:42:02,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-28 03:42:02,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-28 03:42:02,953 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-28 03:42:02,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-28 03:42:02,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-28 03:42:02,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~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; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#true} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {4651#true} assume !(~z~0 % 4294967296 > 0); {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {4651#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-28 03:42:02,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-28 03:42:02,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-28 03:42:02,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-28 03:42:02,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4651#true} is VALID [2022-04-28 03:42:02,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4651#true} is VALID [2022-04-28 03:42:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:02,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798915904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:02,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:02,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 8 [2022-04-28 03:42:02,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:02,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1152225083] [2022-04-28 03:42:02,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1152225083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:02,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:02,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:42:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917086783] [2022-04-28 03:42:02,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:02,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:02,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:02,999 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 03:42:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:42:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:42:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:42:03,000 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,506 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2022-04-28 03:42:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:42:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-28 03:42:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-28 03:42:03,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2022-04-28 03:42:03,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:03,551 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:42:03,551 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:42:03,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:42:03,552 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:03,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:42:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-04-28 03:42:03,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:03,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,631 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,631 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,633 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-28 03:42:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-28 03:42:03,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:42:03,634 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:42:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,645 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-28 03:42:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-28 03:42:03,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:03,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-04-28 03:42:03,647 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 24 [2022-04-28 03:42:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:03,647 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-04-28 03:42:03,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:03,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 70 transitions. [2022-04-28 03:42:04,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-04-28 03:42:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:42:04,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:04,332 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:04,348 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 03:42:04,548 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,SelfDestructingSolverStorable13 [2022-04-28 03:42:04,549 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1703302776, now seen corresponding path program 3 times [2022-04-28 03:42:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:04,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780407869] [2022-04-28 03:42:04,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:04,687 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 513778662, now seen corresponding path program 1 times [2022-04-28 03:42:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:04,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303658465] [2022-04-28 03:42:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:04,701 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,748 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {5258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5249#true} is VALID [2022-04-28 03:42:04,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-28 03:42:04,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-28 03:42:04,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:04,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5249#true} is VALID [2022-04-28 03:42:04,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-28 03:42:04,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-28 03:42:04,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-28 03:42:04,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-28 03:42:04,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-28 03:42:04,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:04,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:04,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {5254#(<= 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; {5255#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:04,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {5255#(<= 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; {5256#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:04,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {5256#(<= 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; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:04,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:04,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#(<= (+ 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; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:04,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {5257#(<= (+ 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; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:04,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:04,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-28 03:42:04,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,819 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-28 03:42:04,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-28 03:42:04,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-28 03:42:04,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-28 03:42:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303658465] [2022-04-28 03:42:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303658465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708544577] [2022-04-28 03:42:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:04,822 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 03:42:04,832 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 03:42:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:04,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2022-04-28 03:42:04,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5249#true} is VALID [2022-04-28 03:42:04,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-28 03:42:04,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-28 03:42:04,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-28 03:42:04,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-28 03:42:04,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-28 03:42:04,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5249#true} is VALID [2022-04-28 03:42:04,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {5249#true} ~z~0 := ~y~0; {5286#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:04,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {5286#(= 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; {5290#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:04,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#(= 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; {5294#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:42:04,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {5294#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:04,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:04,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {5298#(< 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; {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:04,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(< 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; {5309#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:04,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {5309#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {5250#false} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-28 03:42:04,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-28 03:42:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:04,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:05,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-28 03:42:05,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-28 03:42:05,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-28 03:42:05,045 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-28 03:42:05,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:05,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:05,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-28 03:42:05,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {5250#false} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:05,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {5309#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-28 03:42:05,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(< 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; {5309#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:05,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {5298#(< 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; {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:05,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:05,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {5373#(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; {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:05,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {5377#(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; {5373#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {5381#(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; {5377#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {5249#true} ~z~0 := ~y~0; {5381#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5249#true} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2022-04-28 03:42:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708544577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:05,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:05,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-04-28 03:42:05,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:05,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780407869] [2022-04-28 03:42:05,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780407869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:05,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:05,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:42:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60930055] [2022-04-28 03:42:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:42:05,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:05,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:05,209 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 03:42:05,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:42:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:42:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:42:05,210 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:06,309 INFO L93 Difference]: Finished difference Result 140 states and 211 transitions. [2022-04-28 03:42:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:42:06,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:42:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-28 03:42:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-28 03:42:06,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2022-04-28 03:42:06,427 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 03:42:06,428 INFO L225 Difference]: With dead ends: 140 [2022-04-28 03:42:06,429 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 03:42:06,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:42:06,431 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:06,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 53 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 03:42:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 63. [2022-04-28 03:42:06,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:06,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:06,567 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:06,567 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:06,569 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-04-28 03:42:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-04-28 03:42:06,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:06,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:06,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:42:06,570 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:42:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:06,571 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-04-28 03:42:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-04-28 03:42:06,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:06,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:06,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:06,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-28 03:42:06,573 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 25 [2022-04-28 03:42:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:06,573 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-28 03:42:06,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 03:42:06,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-28 03:42:08,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 87 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-28 03:42:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:42:08,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:08,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:08,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:09,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 03:42:09,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2090989180, now seen corresponding path program 2 times [2022-04-28 03:42:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:09,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070694156] [2022-04-28 03:42:09,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:09,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1469062490, now seen corresponding path program 1 times [2022-04-28 03:42:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:09,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428501006] [2022-04-28 03:42:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:09,364 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:09,376 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:09,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {6079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:09,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {6079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-28 03:42:09,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-28 03:42:09,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-28 03:42:09,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-28 03:42:09,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6071#true} is VALID [2022-04-28 03:42:09,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-28 03:42:09,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-28 03:42:09,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-28 03:42:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:09,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428501006] [2022-04-28 03:42:09,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428501006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:09,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726970198] [2022-04-28 03:42:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:09,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:09,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:09,458 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 03:42:09,464 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 03:42:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:42:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:09,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:09,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-28 03:42:09,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6071#true} is VALID [2022-04-28 03:42:09,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-28 03:42:09,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-28 03:42:09,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,708 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-28 03:42:09,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-28 03:42:09,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-28 03:42:09,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-28 03:42:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:09,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:09,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-28 03:42:09,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-28 03:42:09,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-28 03:42:09,906 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-28 03:42:09,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-28 03:42:09,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:09,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:09,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:09,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6071#true} is VALID [2022-04-28 03:42:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726970198] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:09,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-28 03:42:09,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:09,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070694156] [2022-04-28 03:42:09,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070694156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:09,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:09,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:42:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143702628] [2022-04-28 03:42:09,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 26 [2022-04-28 03:42:09,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:09,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 03:42:09,980 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 03:42:09,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:42:09,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:42:09,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:42:09,981 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 03:42:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:10,649 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2022-04-28 03:42:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:42:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 26 [2022-04-28 03:42:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 03:42:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 03:42:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 03:42:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 03:42:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-28 03:42:10,700 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 03:42:10,703 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:42:10,703 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:42:10,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:42:10,713 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:10,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:42:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-04-28 03:42:10,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:10,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,841 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,841 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:10,847 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 03:42:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 03:42:10,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:10,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:10,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states 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 03:42:10,848 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states 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 03:42:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:10,854 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-28 03:42:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-28 03:42:10,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:10,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:10,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:10,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-04-28 03:42:10,855 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 26 [2022-04-28 03:42:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:10,855 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-04-28 03:42:10,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 03:42:10,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 90 transitions. [2022-04-28 03:42:13,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 89 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-04-28 03:42:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:42:13,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:13,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:13,264 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 03:42:13,464 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,SelfDestructingSolverStorable15 [2022-04-28 03:42:13,465 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-04-28 03:42:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820812590] [2022-04-28 03:42:13,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:13,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash 634434391, now seen corresponding path program 1 times [2022-04-28 03:42:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:13,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605150334] [2022-04-28 03:42:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:13,623 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,633 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6694#true} is VALID [2022-04-28 03:42:13,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-28 03:42:13,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-28 03:42:13,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:13,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6694#true} is VALID [2022-04-28 03:42:13,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-28 03:42:13,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-28 03:42:13,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-28 03:42:13,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-28 03:42:13,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-28 03:42:13,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6694#true} is VALID [2022-04-28 03:42:13,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:42:13,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6700#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:13,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {6700#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:13,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:13,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !(~y~0 % 4294967296 > 0); {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:13,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {6703#(<= main_~y~0 (+ (* (div main_~y~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; {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:42:13,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~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; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:13,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-28 03:42:13,707 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-28 03:42:13,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-28 03:42:13,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-28 03:42:13,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-28 03:42:13,707 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 03:42:13,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605150334] [2022-04-28 03:42:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605150334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391230629] [2022-04-28 03:42:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:13,724 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 03:42:13,755 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 03:42:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:13,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-28 03:42:13,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-28 03:42:13,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6694#true} is VALID [2022-04-28 03:42:13,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:42:13,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {6735#(< 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; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:42:13,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {6745#(< 0 (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; {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:42:13,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:42:13,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {6749#(< 0 (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; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:42:13,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {6745#(< 0 (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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-28 03:42:13,886 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-28 03:42:13,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-28 03:42:13,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-28 03:42:13,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-28 03:42:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:13,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:13,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-28 03:42:13,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-28 03:42:13,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-28 03:42:13,971 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-28 03:42:13,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-28 03:42:13,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {6745#(< 0 (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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {6749#(< 0 (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; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:42:13,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:42:13,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {6745#(< 0 (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; {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:42:13,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {6735#(< 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; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:42:13,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {6834#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:13,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6834#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:13,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2022-04-28 03:42:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:42:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391230629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:13,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:13,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-28 03:42:14,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:14,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820812590] [2022-04-28 03:42:14,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820812590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:14,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:14,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105267526] [2022-04-28 03:42:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:14,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:14,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:14,040 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 03:42:14,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:42:14,041 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:15,145 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2022-04-28 03:42:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:42:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-28 03:42:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-28 03:42:15,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2022-04-28 03:42:15,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:15,235 INFO L225 Difference]: With dead ends: 93 [2022-04-28 03:42:15,235 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 03:42:15,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:42:15,236 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:15,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 49 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 03:42:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2022-04-28 03:42:15,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:15,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:15,412 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:15,412 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:15,413 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2022-04-28 03:42:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-04-28 03:42:15,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:15,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:15,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 03:42:15,414 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 03:42:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:15,415 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2022-04-28 03:42:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-04-28 03:42:15,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:15,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:15,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:15,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2022-04-28 03:42:15,416 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 27 [2022-04-28 03:42:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:15,416 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-04-28 03:42:15,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:15,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 99 transitions. [2022-04-28 03:42:17,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2022-04-28 03:42:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:42:17,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:17,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:17,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:18,113 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,SelfDestructingSolverStorable16 [2022-04-28 03:42:18,113 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1238601096, now seen corresponding path program 3 times [2022-04-28 03:42:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:18,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511958148] [2022-04-28 03:42:18,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:18,298 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:18,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1674725082, now seen corresponding path program 1 times [2022-04-28 03:42:18,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:18,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130437785] [2022-04-28 03:42:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:18,309 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:18,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:18,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {7415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:18,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {7415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-28 03:42:18,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-28 03:42:18,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-28 03:42:18,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:18,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:18,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {7410#(<= 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; {7411#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:18,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {7411#(<= 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; {7412#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {7412#(<= 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; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {7413#(<= 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; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#(<= 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; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#(<= 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; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:18,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#(<= 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; {7414#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:18,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {7414#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {7406#false} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-28 03:42:18,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,412 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-28 03:42:18,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-28 03:42:18,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-28 03:42:18,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-28 03:42:18,412 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 03:42:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:18,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130437785] [2022-04-28 03:42:18,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130437785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:18,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269253006] [2022-04-28 03:42:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:18,414 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 03:42:18,415 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 03:42:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:18,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:42:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:18,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:18,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-28 03:42:18,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7405#true} is VALID [2022-04-28 03:42:18,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {7405#true} ~z~0 := ~y~0; {7443#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:18,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {7443#(= 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; {7447#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:42:18,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {7447#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7451#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:18,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {7451#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:18,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:18,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 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; {7462#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:42:18,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {7462#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7466#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:42:18,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {7466#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~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; {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:18,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:18,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~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; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-28 03:42:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:18,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-28 03:42:18,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-28 03:42:18,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(< 0 (mod main_~z~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; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {7532#(< 0 (mod (+ main_~z~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; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:18,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {7536#(< 0 (mod (+ main_~z~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; {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:18,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {7540#(< 0 (mod (+ main_~z~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; {7536#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:18,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:42:18,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {7536#(< 0 (mod (+ main_~z~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; {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:42:18,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7536#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:18,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {7405#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:18,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {7405#true} ~z~0 := ~y~0; {7405#true} is VALID [2022-04-28 03:42:18,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7405#true} is VALID [2022-04-28 03:42:18,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-28 03:42:18,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-28 03:42:18,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-28 03:42:18,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-28 03:42:18,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-28 03:42:18,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7405#true} is VALID [2022-04-28 03:42:18,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2022-04-28 03:42:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:18,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269253006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:18,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:18,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2022-04-28 03:42:18,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511958148] [2022-04-28 03:42:18,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511958148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:18,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:18,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914437586] [2022-04-28 03:42:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 27 [2022-04-28 03:42:18,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:18,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 03:42:18,869 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 03:42:18,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:18,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:42:18,870 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 03:42:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:20,432 INFO L93 Difference]: Finished difference Result 195 states and 282 transitions. [2022-04-28 03:42:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:42:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 27 [2022-04-28 03:42:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 03:42:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-04-28 03:42:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 03:42:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-04-28 03:42:20,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 113 transitions. [2022-04-28 03:42:20,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:20,597 INFO L225 Difference]: With dead ends: 195 [2022-04-28 03:42:20,597 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 03:42:20,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:42:20,598 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:20,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 50 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 03:42:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 84. [2022-04-28 03:42:20,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:20,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:20,965 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:20,965 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:20,967 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2022-04-28 03:42:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 236 transitions. [2022-04-28 03:42:20,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:20,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:20,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-28 03:42:20,968 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-28 03:42:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:20,970 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2022-04-28 03:42:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 236 transitions. [2022-04-28 03:42:20,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:20,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:20,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:20,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2022-04-28 03:42:20,975 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 27 [2022-04-28 03:42:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:20,975 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2022-04-28 03:42:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 03:42:20,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 115 transitions. [2022-04-28 03:42:23,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 114 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2022-04-28 03:42:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:42:23,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:23,456 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:23,473 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 03:42:23,656 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,SelfDestructingSolverStorable17 [2022-04-28 03:42:23,657 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1072099492, now seen corresponding path program 4 times [2022-04-28 03:42:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978846231] [2022-04-28 03:42:25,750 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:25,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:25,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash 558354566, now seen corresponding path program 1 times [2022-04-28 03:42:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:25,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758078044] [2022-04-28 03:42:25,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:25,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:25,857 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,873 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {8504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8494#true} is VALID [2022-04-28 03:42:25,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:25,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-28 03:42:25,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-28 03:42:25,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-28 03:42:25,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8494#true} is VALID [2022-04-28 03:42:25,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8494#true} is VALID [2022-04-28 03:42:25,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {8494#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8499#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:25,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {8499#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {8494#true} is VALID [2022-04-28 03:42:25,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {8494#true} assume !(~z~0 % 4294967296 > 0); {8500#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:42:25,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8501#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:42:25,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {8501#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8502#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-28 03:42:25,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {8502#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:25,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:25,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:25,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {8495#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {8495#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-28 03:42:25,940 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-28 03:42:25,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-28 03:42:25,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-28 03:42:25,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-28 03:42:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:42:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758078044] [2022-04-28 03:42:25,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758078044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267918774] [2022-04-28 03:42:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:25,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:25,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:25,942 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 03:42:25,943 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 03:42:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:42:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:25,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:26,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8494#true} is VALID [2022-04-28 03:42:26,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8494#true} is VALID [2022-04-28 03:42:26,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-28 03:42:26,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-28 03:42:26,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-28 03:42:26,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-28 03:42:26,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-28 03:42:26,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8494#true} is VALID [2022-04-28 03:42:26,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8532#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:26,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {8532#(= 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; {8536#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:26,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {8536#(= 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; {8540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:42:26,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:42:26,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {8544#(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; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {8548#(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; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {8552#(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; {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:42:26,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:42:26,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {8556#(not (< 0 (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; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {8552#(not (< 0 (mod main_~y~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; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-28 03:42:26,128 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-28 03:42:26,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-28 03:42:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:26,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:26,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-28 03:42:26,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-28 03:42:26,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-28 03:42:26,275 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-28 03:42:26,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-28 03:42:26,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-28 03:42:26,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {8552#(not (< 0 (mod main_~y~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; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {8556#(not (< 0 (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; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:42:26,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {8552#(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; {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:42:26,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {8548#(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; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:26,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {8544#(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; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {8638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:42:26,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {8642#(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; {8638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:42:26,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {8646#(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; {8642#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8646#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8494#true} is VALID [2022-04-28 03:42:26,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8494#true} is VALID [2022-04-28 03:42:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:26,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267918774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:26,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:26,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-04-28 03:42:26,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:26,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978846231] [2022-04-28 03:42:26,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978846231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:26,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:26,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990185350] [2022-04-28 03:42:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 28 [2022-04-28 03:42:26,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:26,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:26,373 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 03:42:26,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:26,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:26,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:42:26,374 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:27,682 INFO L93 Difference]: Finished difference Result 153 states and 217 transitions. [2022-04-28 03:42:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:42:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 28 [2022-04-28 03:42:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-28 03:42:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-28 03:42:27,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 81 transitions. [2022-04-28 03:42:27,760 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 03:42:27,762 INFO L225 Difference]: With dead ends: 153 [2022-04-28 03:42:27,762 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 03:42:27,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:42:27,763 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:27,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 53 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 03:42:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2022-04-28 03:42:28,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:28,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,216 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,216 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:28,217 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2022-04-28 03:42:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2022-04-28 03:42:28,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:28,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:28,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-28 03:42:28,218 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-28 03:42:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:28,220 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2022-04-28 03:42:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2022-04-28 03:42:28,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:28,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:28,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:28,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2022-04-28 03:42:28,222 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 28 [2022-04-28 03:42:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:28,222 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2022-04-28 03:42:28,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:42:28,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 156 transitions. [2022-04-28 03:42:32,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 155 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2022-04-28 03:42:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:42:32,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:32,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:32,405 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 03:42:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:32,587 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 3 times [2022-04-28 03:42:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851808353] [2022-04-28 03:42:34,748 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:34,823 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:34,824 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1460360169, now seen corresponding path program 1 times [2022-04-28 03:42:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421773870] [2022-04-28 03:42:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:34,835 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:34,849 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:34,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {9536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9526#true} is VALID [2022-04-28 03:42:34,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-28 03:42:34,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:34,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {9536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-28 03:42:34,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-28 03:42:34,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {9531#(<= 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; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:34,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {9532#(<= 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; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {9533#(<= 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; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {9533#(<= 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; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {9533#(<= 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; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:34,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {9532#(<= 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; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:34,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:34,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:34,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:34,930 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:42:34,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {9534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:42:34,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {9535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9527#false} is VALID [2022-04-28 03:42:34,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-28 03:42:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421773870] [2022-04-28 03:42:34,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421773870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113408787] [2022-04-28 03:42:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:34,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:34,936 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 03:42:34,937 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 03:42:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:34,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:34,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:35,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-28 03:42:35,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9526#true} is VALID [2022-04-28 03:42:35,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-28 03:42:35,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {9526#true} ~z~0 := ~y~0; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#true} assume !(~z~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#true} assume !(~y~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-28 03:42:35,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-28 03:42:35,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-28 03:42:35,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#true} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:35,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:35,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:35,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:35,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,183 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:35,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:35,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {9616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-28 03:42:35,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-28 03:42:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:42:35,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:35,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-28 03:42:35,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {9616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-28 03:42:35,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:35,378 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:35,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:35,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:35,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#true} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#true} assume !(~y~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-28 03:42:35,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#true} assume !(~z~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {9526#true} ~z~0 := ~y~0; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9526#true} is VALID [2022-04-28 03:42:35,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-28 03:42:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:42:35,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113408787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:35,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:35,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 03:42:35,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:35,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851808353] [2022-04-28 03:42:35,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851808353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:35,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:35,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636933104] [2022-04-28 03:42:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:35,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) 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 29 [2022-04-28 03:42:35,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:35,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) 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 03:42:35,465 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 03:42:35,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:35,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:42:35,466 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand has 10 states, 10 states have (on average 2.4) 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 03:42:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:36,577 INFO L93 Difference]: Finished difference Result 169 states and 238 transitions. [2022-04-28 03:42:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) 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 29 [2022-04-28 03:42:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) 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 03:42:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-28 03:42:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) 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 03:42:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-28 03:42:36,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-04-28 03:42:36,660 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 03:42:36,661 INFO L225 Difference]: With dead ends: 169 [2022-04-28 03:42:36,661 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 03:42:36,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:42:36,662 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:36,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 03:42:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2022-04-28 03:42:37,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:37,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 03:42:37,107 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 03:42:37,107 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 03:42:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:37,109 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-28 03:42:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-28 03:42:37,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:37,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:37,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 164 states. [2022-04-28 03:42:37,110 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 164 states. [2022-04-28 03:42:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:37,112 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-28 03:42:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-28 03:42:37,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:37,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:37,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:37,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 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 03:42:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2022-04-28 03:42:37,114 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 29 [2022-04-28 03:42:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:37,114 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2022-04-28 03:42:37,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) 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 03:42:37,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 167 transitions. [2022-04-28 03:42:37,864 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 03:42:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2022-04-28 03:42:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:42:37,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:37,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:37,882 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 03:42:38,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:38,065 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:38,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:38,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1591798503, now seen corresponding path program 4 times [2022-04-28 03:42:38,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:38,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479507331] [2022-04-28 03:42:38,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:38,207 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 945091063, now seen corresponding path program 1 times [2022-04-28 03:42:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:38,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426905031] [2022-04-28 03:42:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:38,216 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:38,239 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:38,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {10637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10626#true} is VALID [2022-04-28 03:42:38,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 03:42:38,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-28 03:42:38,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:38,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10626#true} is VALID [2022-04-28 03:42:38,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10631#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:42:38,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {10631#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10632#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:38,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {10632#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10633#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:38,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {10633#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10634#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:38,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {10634#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10635#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:38,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {10635#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10636#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {10636#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {10627#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; {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {10627#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; {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {10627#false} assume !(~x~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {10627#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {10627#false} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-28 03:42:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:42:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:38,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426905031] [2022-04-28 03:42:38,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426905031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:38,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375217159] [2022-04-28 03:42:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:38,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:38,348 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 03:42:38,349 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 03:42:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:38,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:42:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:38,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10626#true} is VALID [2022-04-28 03:42:38,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10626#true} is VALID [2022-04-28 03:42:38,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:38,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:38,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:38,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {10672#(< 0 (mod (+ main_~z~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; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:38,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {10668#(< 0 (mod (+ main_~z~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; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:38,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {10686#(< 0 (mod (+ main_~z~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; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {10686#(< 0 (mod (+ main_~z~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; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-28 03:42:38,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-28 03:42:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:38,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-28 03:42:38,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-28 03:42:38,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:38,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {10686#(< 0 (mod (+ main_~z~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; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {10686#(< 0 (mod (+ main_~z~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; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:38,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {10668#(< 0 (mod (+ main_~z~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; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:38,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {10672#(< 0 (mod (+ main_~z~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; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:38,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:38,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:38,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:38,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10626#true} is VALID [2022-04-28 03:42:38,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-28 03:42:38,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10626#true} is VALID [2022-04-28 03:42:38,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-28 03:42:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375217159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:38,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-04-28 03:42:38,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479507331] [2022-04-28 03:42:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479507331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:38,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:38,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:42:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984890216] [2022-04-28 03:42:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 29 [2022-04-28 03:42:38,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:38,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 03:42:38,681 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 03:42:38,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:42:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:42:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:42:38,682 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 03:42:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:39,876 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2022-04-28 03:42:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:42:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 29 [2022-04-28 03:42:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 03:42:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 03:42:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 03:42:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 03:42:39,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-28 03:42:39,944 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 03:42:39,946 INFO L225 Difference]: With dead ends: 141 [2022-04-28 03:42:39,946 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 03:42:39,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:42:39,947 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:39,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 03:42:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-04-28 03:42:40,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:40,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:40,317 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:40,317 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:40,319 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-28 03:42:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-28 03:42:40,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:40,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:40,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:42:40,320 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 118 states. [2022-04-28 03:42:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:40,321 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-28 03:42:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-28 03:42:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:40,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:40,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:40,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2022-04-28 03:42:40,323 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 29 [2022-04-28 03:42:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2022-04-28 03:42:40,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 03:42:40,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 154 transitions. [2022-04-28 03:42:42,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2022-04-28 03:42:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:42:42,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:42,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:42,159 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 03:42:42,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:42,344 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1563256359, now seen corresponding path program 4 times [2022-04-28 03:42:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:42,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451591352] [2022-04-28 03:42:42,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:42,458 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1615189751, now seen corresponding path program 1 times [2022-04-28 03:42:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370791501] [2022-04-28 03:42:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:42,469 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,536 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {11588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11577#true} is VALID [2022-04-28 03:42:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-28 03:42:42,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-28 03:42:42,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {11588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11577#true} is VALID [2022-04-28 03:42:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-28 03:42:42,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-28 03:42:42,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-28 03:42:42,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-28 03:42:42,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-28 03:42:42,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11577#true} is VALID [2022-04-28 03:42:42,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:42,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:42,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:42,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:42,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:42,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-28 03:42:42,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-28 03:42:42,605 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 03:42:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:42,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370791501] [2022-04-28 03:42:42,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370791501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:42,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606936058] [2022-04-28 03:42:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:42,607 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 03:42:42,607 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 03:42:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:42,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11577#true} is VALID [2022-04-28 03:42:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11577#true} is VALID [2022-04-28 03:42:42,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-28 03:42:42,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-28 03:42:42,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-28 03:42:42,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-28 03:42:42,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-28 03:42:42,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11577#true} is VALID [2022-04-28 03:42:42,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:42,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:42,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:42,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:42,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:42,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:42,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:42,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:42,845 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-28 03:42:42,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-28 03:42:42,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-28 03:42:42,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-28 03:42:42,846 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 03:42:42,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:43,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:43,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#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; {11578#false} is VALID [2022-04-28 03:42:43,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-28 03:42:43,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:42:43,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:42:43,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:43,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {11721#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:42:43,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {11725#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11721#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:42:43,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {11729#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11725#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11729#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11577#true} is VALID [2022-04-28 03:42:43,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11577#true} is VALID [2022-04-28 03:42:43,062 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 03:42:43,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606936058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:43,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:43,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:42:43,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451591352] [2022-04-28 03:42:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451591352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:43,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:43,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:42:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658949898] [2022-04-28 03:42:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:43,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 29 [2022-04-28 03:42:43,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:43,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 03:42:43,127 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 03:42:43,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:42:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:42:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:42:43,128 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 03:42:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,139 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2022-04-28 03:42:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:42:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 29 [2022-04-28 03:42:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 03:42:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-28 03:42:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 03:42:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-28 03:42:44,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2022-04-28 03:42:44,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:44,237 INFO L225 Difference]: With dead ends: 135 [2022-04-28 03:42:44,237 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:42:44,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:42:44,238 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:44,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 59 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:42:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2022-04-28 03:42:44,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:44,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,606 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,606 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,612 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-04-28 03:42:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2022-04-28 03:42:44,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:44,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:44,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 03:42:44,612 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 03:42:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,616 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-04-28 03:42:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2022-04-28 03:42:44,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:44,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:44,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:44,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2022-04-28 03:42:44,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 29 [2022-04-28 03:42:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:44,618 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2022-04-28 03:42:44,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 03:42:44,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 129 transitions. [2022-04-28 03:42:47,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2022-04-28 03:42:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:42:47,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:47,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:47,269 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 03:42:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 03:42:47,461 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash -34809929, now seen corresponding path program 5 times [2022-04-28 03:42:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:47,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298401606] [2022-04-28 03:42:47,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:47,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -509774571, now seen corresponding path program 1 times [2022-04-28 03:42:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389418328] [2022-04-28 03:42:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:47,650 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:47,666 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:47,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:47,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {12464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12451#true} is VALID [2022-04-28 03:42:47,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-28 03:42:47,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-28 03:42:47,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:47,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {12464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12451#true} is VALID [2022-04-28 03:42:47,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-28 03:42:47,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-28 03:42:47,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-28 03:42:47,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-28 03:42:47,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-28 03:42:47,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12451#true} is VALID [2022-04-28 03:42:47,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:47,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:47,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12458#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 2))))} is VALID [2022-04-28 03:42:47,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {12458#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 2))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:42:47,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:42:47,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~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; {12460#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-28 03:42:47,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {12460#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12461#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {12461#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12463#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:47,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {12463#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:47,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:47,801 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-28 03:42:47,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-28 03:42:47,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-28 03:42:47,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-28 03:42:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:47,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389418328] [2022-04-28 03:42:47,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389418328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:47,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818883433] [2022-04-28 03:42:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:47,803 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 03:42:47,807 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 03:42:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:47,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:42:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:47,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:47,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12451#true} is VALID [2022-04-28 03:42:47,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12451#true} is VALID [2022-04-28 03:42:47,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-28 03:42:47,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-28 03:42:47,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-28 03:42:47,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-28 03:42:47,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-28 03:42:47,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12451#true} is VALID [2022-04-28 03:42:47,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:42:47,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:47,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12498#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:47,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {12498#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:42:47,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:42:47,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~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; {12509#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:47,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {12509#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:47,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:47,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:48,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-28 03:42:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:48,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:48,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-28 03:42:48,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-28 03:42:48,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-28 03:42:48,074 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-28 03:42:48,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:48,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-28 03:42:48,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:48,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {12517#(< 0 (mod (+ main_~z~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; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:48,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {12593#(< 0 (mod (+ main_~z~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; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:48,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {12597#(< 0 (mod (+ main_~z~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; {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:48,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:48,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {12451#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {12451#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-28 03:42:48,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-28 03:42:48,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-28 03:42:48,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12451#true} is VALID [2022-04-28 03:42:48,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12451#true} is VALID [2022-04-28 03:42:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:42:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818883433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:48,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:48,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 18 [2022-04-28 03:42:48,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298401606] [2022-04-28 03:42:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298401606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:42:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756251512] [2022-04-28 03:42:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-28 03:42:48,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:48,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 03:42:48,239 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 03:42:48,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:42:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:42:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:42:48,240 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 03:42:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,258 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2022-04-28 03:42:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:42:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-28 03:42:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 03:42:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2022-04-28 03:42:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 03:42:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2022-04-28 03:42:50,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 80 transitions. [2022-04-28 03:42:50,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:50,419 INFO L225 Difference]: With dead ends: 141 [2022-04-28 03:42:50,419 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 03:42:50,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:42:50,420 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:50,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 67 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:42:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 03:42:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 106. [2022-04-28 03:42:50,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:50,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,755 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,755 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,757 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2022-04-28 03:42:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2022-04-28 03:42:50,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:50,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:50,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 03:42:50,758 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-28 03:42:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:50,759 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2022-04-28 03:42:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2022-04-28 03:42:50,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:50,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:50,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:50,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2022-04-28 03:42:50,760 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 29 [2022-04-28 03:42:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:50,761 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2022-04-28 03:42:50,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 03:42:50,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 147 transitions. [2022-04-28 03:42:53,114 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 03:42:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2022-04-28 03:42:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:42:53,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:53,115 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:53,131 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 03:42:53,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:53,315 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -912778699, now seen corresponding path program 5 times [2022-04-28 03:42:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:53,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880098054] [2022-04-28 03:42:53,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:53,462 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -43397033, now seen corresponding path program 1 times [2022-04-28 03:42:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97132552] [2022-04-28 03:42:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:53,473 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,506 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {13445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13437#true} is VALID [2022-04-28 03:42:53,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {13437#true} assume true; {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13437#true} {13437#true} #94#return; {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {13437#true} call ULTIMATE.init(); {13445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:53,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {13445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {13437#true} assume true; {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13437#true} {13437#true} #94#return; {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {13437#true} call #t~ret17 := main(); {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {13437#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13437#true} is VALID [2022-04-28 03:42:53,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {13437#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {13437#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {13437#true} ~z~0 := ~y~0; {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {13437#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {13437#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {13437#true} assume !(~z~0 % 4294967296 > 0); {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {13437#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#true} is VALID [2022-04-28 03:42:53,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {13437#true} assume !(~y~0 % 4294967296 > 0); {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:53,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~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; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:53,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:53,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:53,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13438#false} is VALID [2022-04-28 03:42:53,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {13438#false} assume !(~y~0 % 4294967296 > 0); {13438#false} is VALID [2022-04-28 03:42:53,569 INFO L272 TraceCheckUtils]: 25: Hoare triple {13438#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13438#false} is VALID [2022-04-28 03:42:53,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {13438#false} ~cond := #in~cond; {13438#false} is VALID [2022-04-28 03:42:53,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {13438#false} assume 0 == ~cond; {13438#false} is VALID [2022-04-28 03:42:53,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {13438#false} assume !false; {13438#false} is VALID [2022-04-28 03:42:53,569 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 03:42:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:53,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97132552] [2022-04-28 03:42:53,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97132552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:53,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643582030] [2022-04-28 03:42:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:53,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:53,580 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 03:42:53,582 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 03:42:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:42:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:53,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {13437#true} call ULTIMATE.init(); {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {13437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {13437#true} assume true; {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13437#true} {13437#true} #94#return; {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {13437#true} call #t~ret17 := main(); {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {13437#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13437#true} is VALID [2022-04-28 03:42:53,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {13437#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13437#true} is VALID [2022-04-28 03:42:53,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {13437#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13437#true} is VALID [2022-04-28 03:42:53,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {13437#true} ~z~0 := ~y~0; {13473#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:53,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {13473#(= 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; {13477#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:53,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {13477#(= 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; {13481#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:42:53,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {13481#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:53,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:53,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:53,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~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; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:53,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:53,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:53,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:53,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13438#false} is VALID [2022-04-28 03:42:53,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {13438#false} assume !(~y~0 % 4294967296 > 0); {13438#false} is VALID [2022-04-28 03:42:53,855 INFO L272 TraceCheckUtils]: 25: Hoare triple {13438#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13438#false} is VALID [2022-04-28 03:42:53,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {13438#false} ~cond := #in~cond; {13438#false} is VALID [2022-04-28 03:42:53,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {13438#false} assume 0 == ~cond; {13438#false} is VALID [2022-04-28 03:42:53,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {13438#false} assume !false; {13438#false} is VALID [2022-04-28 03:42:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:53,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:54,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {13438#false} assume !false; {13438#false} is VALID [2022-04-28 03:42:54,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {13438#false} assume 0 == ~cond; {13438#false} is VALID [2022-04-28 03:42:54,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {13438#false} ~cond := #in~cond; {13438#false} is VALID [2022-04-28 03:42:54,090 INFO L272 TraceCheckUtils]: 25: Hoare triple {13438#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13438#false} is VALID [2022-04-28 03:42:54,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {13438#false} assume !(~y~0 % 4294967296 > 0); {13438#false} is VALID [2022-04-28 03:42:54,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13438#false} is VALID [2022-04-28 03:42:54,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:54,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:54,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~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; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:54,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:54,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13442#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:54,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13443#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:54,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {13587#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13444#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {13591#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13587#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:54,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {13595#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13591#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {13437#true} ~z~0 := ~y~0; {13595#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {13437#true} [135] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {13437#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {13437#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {13437#true} call #t~ret17 := main(); {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13437#true} {13437#true} #94#return; {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {13437#true} assume true; {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {13437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13437#true} is VALID [2022-04-28 03:42:54,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {13437#true} call ULTIMATE.init(); {13437#true} is VALID [2022-04-28 03:42:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:54,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643582030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:54,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:54,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2022-04-28 03:42:54,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880098054] [2022-04-28 03:42:54,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880098054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:54,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:54,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:42:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398290556] [2022-04-28 03:42:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:54,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:42:54,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:54,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 03:42:54,213 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 03:42:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:42:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:42:54,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:42:54,213 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 03:42:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:55,283 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2022-04-28 03:42:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:42:55,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:42:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 03:42:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-04-28 03:42:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 03:42:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-04-28 03:42:55,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 88 transitions. [2022-04-28 03:42:55,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:55,376 INFO L225 Difference]: With dead ends: 211 [2022-04-28 03:42:55,376 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 03:42:55,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:42:55,377 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:55,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 03:42:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-28 03:42:55,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:55,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:55,794 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:55,794 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:55,796 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-28 03:42:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-28 03:42:55,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:55,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:55,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 03:42:55,797 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 03:42:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:55,798 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-28 03:42:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-28 03:42:55,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:55,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:55,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:55,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2022-04-28 03:42:55,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 30 [2022-04-28 03:42:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:55,800 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2022-04-28 03:42:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 03:42:55,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 136 transitions. [2022-04-28 03:42:58,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 135 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2022-04-28 03:42:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:42:58,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:58,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:58,848 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 03:42:59,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:59,046 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780265, now seen corresponding path program 6 times [2022-04-28 03:42:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:59,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695721848] [2022-04-28 03:42:59,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:59,207 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -358986232, now seen corresponding path program 1 times [2022-04-28 03:42:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:59,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856467928] [2022-04-28 03:42:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:59,219 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,229 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {14497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 03:42:59,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 03:42:59,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14488#true} {14488#true} #94#return; {14488#true} is VALID [2022-04-28 03:42:59,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:59,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {14497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 03:42:59,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #94#return; {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret17 := main(); {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {14488#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {14488#true} ~z~0 := ~y~0; {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {14488#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14488#true} is VALID [2022-04-28 03:42:59,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {14488#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14488#true} is VALID [2022-04-28 03:42:59,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {14488#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14493#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {14493#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14493#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {14493#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:59,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:59,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:59,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:59,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {14489#false} assume !(~y~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,307 INFO L272 TraceCheckUtils]: 25: Hoare triple {14489#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14489#false} is VALID [2022-04-28 03:42:59,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {14489#false} ~cond := #in~cond; {14489#false} is VALID [2022-04-28 03:42:59,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {14489#false} assume 0 == ~cond; {14489#false} is VALID [2022-04-28 03:42:59,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 03:42:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:42:59,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:59,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856467928] [2022-04-28 03:42:59,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856467928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:59,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410460915] [2022-04-28 03:42:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:59,309 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 03:42:59,345 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 03:42:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:42:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:59,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 03:42:59,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 03:42:59,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 03:42:59,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #94#return; {14488#true} is VALID [2022-04-28 03:42:59,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret17 := main(); {14488#true} is VALID [2022-04-28 03:42:59,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14488#true} is VALID [2022-04-28 03:42:59,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14488#true} is VALID [2022-04-28 03:42:59,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {14488#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14488#true} is VALID [2022-04-28 03:42:59,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {14488#true} ~z~0 := ~y~0; {14525#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:59,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {14525#(= 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; {14529#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:59,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {14529#(= 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; {14533#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:42:59,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {14533#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14537#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:42:59,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {14537#(= main_~y~0 (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {14537#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:42:59,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {14537#(= main_~y~0 (+ main_~z~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; {14529#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:59,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {14529#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14547#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:42:59,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {14547#(= main_~z~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; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:59,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:59,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {14489#false} assume !(~y~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L272 TraceCheckUtils]: 25: Hoare triple {14489#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {14489#false} ~cond := #in~cond; {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {14489#false} assume 0 == ~cond; {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 03:42:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:59,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:59,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {14489#false} assume !false; {14489#false} is VALID [2022-04-28 03:42:59,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {14489#false} assume 0 == ~cond; {14489#false} is VALID [2022-04-28 03:42:59,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {14489#false} ~cond := #in~cond; {14489#false} is VALID [2022-04-28 03:42:59,874 INFO L272 TraceCheckUtils]: 25: Hoare triple {14489#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14489#false} is VALID [2022-04-28 03:42:59,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {14489#false} assume !(~y~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14489#false} is VALID [2022-04-28 03:42:59,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14494#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:59,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14495#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:42:59,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {14629#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {14633#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (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; {14629#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} is VALID [2022-04-28 03:42:59,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {14637#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14633#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:42:59,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {14637#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14637#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:59,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {14644#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 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; {14637#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:59,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {14648#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {14644#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:42:59,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {14652#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~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; {14648#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} is VALID [2022-04-28 03:42:59,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {14488#true} ~z~0 := ~y~0; {14652#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:59,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {14488#true} [137] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {14488#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {14488#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {14488#true} call #t~ret17 := main(); {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14488#true} {14488#true} #94#return; {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {14488#true} assume true; {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {14488#true} call ULTIMATE.init(); {14488#true} is VALID [2022-04-28 03:42:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:59,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410460915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:59,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:59,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 18 [2022-04-28 03:42:59,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695721848] [2022-04-28 03:42:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695721848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:59,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:59,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063244992] [2022-04-28 03:42:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:42:59,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:59,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,971 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 03:42:59,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:59,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:42:59,972 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:01,523 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-28 03:43:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:43:01,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:43:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-28 03:43:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-28 03:43:01,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 71 transitions. [2022-04-28 03:43:01,607 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 03:43:01,608 INFO L225 Difference]: With dead ends: 128 [2022-04-28 03:43:01,608 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 03:43:01,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:43:01,609 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:01,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 53 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 03:43:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-04-28 03:43:02,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:02,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:02,043 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:02,043 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:02,045 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2022-04-28 03:43:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2022-04-28 03:43:02,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:02,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:02,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-28 03:43:02,046 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-28 03:43:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:02,047 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2022-04-28 03:43:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2022-04-28 03:43:02,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:02,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:02,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:02,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2022-04-28 03:43:02,048 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 31 [2022-04-28 03:43:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:02,048 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2022-04-28 03:43:02,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:02,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 139 transitions. [2022-04-28 03:43:06,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 138 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2022-04-28 03:43:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:43:06,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:06,272 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:06,288 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 03:43:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:06,474 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1153740601, now seen corresponding path program 7 times [2022-04-28 03:43:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:06,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036093463] [2022-04-28 03:43:06,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:06,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash -417123418, now seen corresponding path program 1 times [2022-04-28 03:43:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:06,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804714325] [2022-04-28 03:43:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:06,646 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:06,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:06,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:06,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {15415#true} assume true; {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15415#true} {15415#true} #94#return; {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {15415#true} call ULTIMATE.init(); {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:06,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {15428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {15415#true} assume true; {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15415#true} {15415#true} #94#return; {15415#true} is VALID [2022-04-28 03:43:06,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {15415#true} call #t~ret17 := main(); {15415#true} is VALID [2022-04-28 03:43:06,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {15415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15415#true} is VALID [2022-04-28 03:43:06,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {15415#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15415#true} is VALID [2022-04-28 03:43:06,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {15415#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15415#true} is VALID [2022-04-28 03:43:06,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {15415#true} ~z~0 := ~y~0; {15420#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:06,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {15420#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15421#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:06,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {15421#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15422#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:06,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {15422#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15423#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:06,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {15423#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {15424#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:06,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {15424#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:06,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:06,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#false} assume !(~x~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#false} assume !(~z~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L272 TraceCheckUtils]: 25: Hoare triple {15416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15416#false} is VALID [2022-04-28 03:43:06,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {15416#false} ~cond := #in~cond; {15416#false} is VALID [2022-04-28 03:43:06,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {15416#false} assume 0 == ~cond; {15416#false} is VALID [2022-04-28 03:43:06,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#false} assume !false; {15416#false} is VALID [2022-04-28 03:43:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804714325] [2022-04-28 03:43:06,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804714325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914538503] [2022-04-28 03:43:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:06,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:06,802 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 03:43:06,803 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 03:43:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:06,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:43:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:06,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:07,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {15415#true} call ULTIMATE.init(); {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {15415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {15415#true} assume true; {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15415#true} {15415#true} #94#return; {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {15415#true} call #t~ret17 := main(); {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {15415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {15415#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {15415#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15415#true} is VALID [2022-04-28 03:43:07,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {15415#true} ~z~0 := ~y~0; {15420#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:07,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {15420#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15421#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:07,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {15421#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15422#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:07,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {15422#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15423#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:07,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {15423#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {15468#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:07,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {15468#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 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; {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:07,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:07,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#false} assume !(~x~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#false} assume !(~z~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {15416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15416#false} is VALID [2022-04-28 03:43:07,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {15416#false} ~cond := #in~cond; {15416#false} is VALID [2022-04-28 03:43:07,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {15416#false} assume 0 == ~cond; {15416#false} is VALID [2022-04-28 03:43:07,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#false} assume !false; {15416#false} is VALID [2022-04-28 03:43:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:07,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:07,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {15416#false} assume !false; {15416#false} is VALID [2022-04-28 03:43:07,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {15416#false} assume 0 == ~cond; {15416#false} is VALID [2022-04-28 03:43:07,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {15416#false} ~cond := #in~cond; {15416#false} is VALID [2022-04-28 03:43:07,612 INFO L272 TraceCheckUtils]: 25: Hoare triple {15416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {15416#false} assume !(~z~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {15416#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {15416#false} assume !(~x~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {15416#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; {15416#false} is VALID [2022-04-28 03:43:07,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {15416#false} assume !(~y~0 % 4294967296 > 0); {15416#false} is VALID [2022-04-28 03:43:07,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15416#false} is VALID [2022-04-28 03:43:07,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15427#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:07,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15426#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:07,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {15468#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ 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; {15425#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:07,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {15565#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15468#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:07,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {15569#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {15565#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:43:07,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {15573#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15569#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:07,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {15577#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {15573#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {15415#true} ~z~0 := ~y~0; {15577#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {15415#true} [139] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {15415#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {15415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {15415#true} call #t~ret17 := main(); {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15415#true} {15415#true} #94#return; {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {15415#true} assume true; {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {15415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15415#true} is VALID [2022-04-28 03:43:07,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {15415#true} call ULTIMATE.init(); {15415#true} is VALID [2022-04-28 03:43:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:07,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914538503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:07,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:07,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:43:07,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036093463] [2022-04-28 03:43:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036093463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:07,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:43:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46107305] [2022-04-28 03:43:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:07,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:07,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:07,765 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 03:43:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:43:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:43:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:07,765 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:09,459 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-28 03:43:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:43:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-28 03:43:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-28 03:43:09,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 97 transitions. [2022-04-28 03:43:09,553 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 03:43:09,554 INFO L225 Difference]: With dead ends: 130 [2022-04-28 03:43:09,554 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:43:09,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:43:09,555 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:09,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 70 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:43:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:43:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2022-04-28 03:43:09,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:09,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,910 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,911 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:09,912 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-28 03:43:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-28 03:43:09,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:09,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:09,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:43:09,912 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:43:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:09,913 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-28 03:43:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-28 03:43:09,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:09,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:09,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:09,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2022-04-28 03:43:09,915 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 31 [2022-04-28 03:43:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:09,915 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2022-04-28 03:43:09,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:09,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 126 transitions. [2022-04-28 03:43:15,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 124 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2022-04-28 03:43:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:43:15,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:15,489 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:15,508 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 03:43:15,689 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,SelfDestructingSolverStorable25 [2022-04-28 03:43:15,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -698470425, now seen corresponding path program 5 times [2022-04-28 03:43:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924367304] [2022-04-28 03:43:15,857 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:15,858 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1548436858, now seen corresponding path program 1 times [2022-04-28 03:43:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204339292] [2022-04-28 03:43:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:15,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:15,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:15,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:15,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {16317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16306#true} is VALID [2022-04-28 03:43:15,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {16306#true} assume true; {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16306#true} {16306#true} #94#return; {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {16306#true} call ULTIMATE.init(); {16317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:15,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {16317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {16306#true} assume true; {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16306#true} {16306#true} #94#return; {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {16306#true} call #t~ret17 := main(); {16306#true} is VALID [2022-04-28 03:43:15,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {16306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16306#true} is VALID [2022-04-28 03:43:15,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {16306#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16306#true} is VALID [2022-04-28 03:43:15,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {16306#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:15,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {16311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {16311#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:15,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {16311#(<= 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; {16312#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:15,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {16312#(<= 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; {16313#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {16313#(<= 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; {16314#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {16314#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {16315#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {16315#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {16315#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {16315#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {16315#(<= 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; {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16315#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:15,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {16315#(<= 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; {16316#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:15,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {16316#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16307#false} is VALID [2022-04-28 03:43:15,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {16307#false} assume !(~z~0 % 4294967296 > 0); {16307#false} is VALID [2022-04-28 03:43:15,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {16307#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {16307#false} assume !(~y~0 % 4294967296 > 0); {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L272 TraceCheckUtils]: 25: Hoare triple {16307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {16307#false} ~cond := #in~cond; {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {16307#false} assume 0 == ~cond; {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {16307#false} assume !false; {16307#false} is VALID [2022-04-28 03:43:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:43:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:15,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204339292] [2022-04-28 03:43:15,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204339292] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:15,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762609212] [2022-04-28 03:43:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:15,956 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 03:43:15,956 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 03:43:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:15,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:43:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:15,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:16,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {16306#true} call ULTIMATE.init(); {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {16306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {16306#true} assume true; {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16306#true} {16306#true} #94#return; {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {16306#true} call #t~ret17 := main(); {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {16306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {16306#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16306#true} is VALID [2022-04-28 03:43:16,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {16306#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16306#true} is VALID [2022-04-28 03:43:16,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {16306#true} ~z~0 := ~y~0; {16345#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:16,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {16345#(= 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; {16349#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:16,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {16349#(= 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; {16353#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:43:16,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {16353#(= (+ 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; {16357#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:43:16,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {16357#(= (+ (- 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; {16361#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:43:16,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {16361#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {16365#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:43:16,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {16365#(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; {16369#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:16,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {16369#(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; {16373#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:16,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {16373#(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; {16377#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:16,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {16377#(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; {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {16381#(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; {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:16,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:16,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {16385#(not (< 0 (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; {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {16307#false} assume !(~y~0 % 4294967296 > 0); {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L272 TraceCheckUtils]: 25: Hoare triple {16307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {16307#false} ~cond := #in~cond; {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {16307#false} assume 0 == ~cond; {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {16307#false} assume !false; {16307#false} is VALID [2022-04-28 03:43:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:16,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:16,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {16307#false} assume !false; {16307#false} is VALID [2022-04-28 03:43:16,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {16307#false} assume 0 == ~cond; {16307#false} is VALID [2022-04-28 03:43:16,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {16307#false} ~cond := #in~cond; {16307#false} is VALID [2022-04-28 03:43:16,316 INFO L272 TraceCheckUtils]: 25: Hoare triple {16307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16307#false} is VALID [2022-04-28 03:43:16,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {16307#false} assume !(~y~0 % 4294967296 > 0); {16307#false} is VALID [2022-04-28 03:43:16,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16307#false} is VALID [2022-04-28 03:43:16,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {16381#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {16385#(not (< 0 (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; {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:16,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {16381#(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; {16385#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:16,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {16377#(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; {16381#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:16,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {16373#(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; {16377#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:16,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {16369#(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; {16373#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:16,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {16365#(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; {16369#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:16,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {16461#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16365#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:43:16,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {16465#(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; {16461#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:16,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {16469#(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; {16465#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:16,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {16473#(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; {16469#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:16,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {16477#(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; {16473#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {16306#true} ~z~0 := ~y~0; {16477#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {16306#true} [141] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {16306#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {16306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {16306#true} call #t~ret17 := main(); {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16306#true} {16306#true} #94#return; {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {16306#true} assume true; {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {16306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16306#true} is VALID [2022-04-28 03:43:16,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {16306#true} call ULTIMATE.init(); {16306#true} is VALID [2022-04-28 03:43:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:16,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762609212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:16,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:16,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 25 [2022-04-28 03:43:16,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924367304] [2022-04-28 03:43:16,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924367304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:16,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:16,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:43:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599177900] [2022-04-28 03:43:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:16,460 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:16,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:16,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:16,501 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 03:43:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:43:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:43:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:43:16,502 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:18,866 INFO L93 Difference]: Finished difference Result 272 states and 403 transitions. [2022-04-28 03:43:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:43:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2022-04-28 03:43:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2022-04-28 03:43:18,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 138 transitions. [2022-04-28 03:43:19,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:19,008 INFO L225 Difference]: With dead ends: 272 [2022-04-28 03:43:19,008 INFO L226 Difference]: Without dead ends: 233 [2022-04-28 03:43:19,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:43:19,008 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:19,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 59 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:43:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-28 03:43:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 109. [2022-04-28 03:43:19,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:19,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,384 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,384 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,386 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2022-04-28 03:43:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-04-28 03:43:19,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-28 03:43:19,387 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 233 states. [2022-04-28 03:43:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,389 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2022-04-28 03:43:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-04-28 03:43:19,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:19,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2022-04-28 03:43:19,391 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 31 [2022-04-28 03:43:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:19,391 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2022-04-28 03:43:19,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 03:43:19,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 150 transitions. [2022-04-28 03:43:24,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-28 03:43:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:43:24,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:24,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:24,924 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 03:43:25,108 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,SelfDestructingSolverStorable26 [2022-04-28 03:43:25,108 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -106095820, now seen corresponding path program 8 times [2022-04-28 03:43:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [130755856] [2022-04-28 03:43:25,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:25,258 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1670263989, now seen corresponding path program 1 times [2022-04-28 03:43:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475838402] [2022-04-28 03:43:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:25,269 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:25,281 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:25,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {17774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17762#true} is VALID [2022-04-28 03:43:25,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {17762#true} assume true; {17762#true} is VALID [2022-04-28 03:43:25,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17762#true} {17762#true} #94#return; {17762#true} is VALID [2022-04-28 03:43:25,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {17762#true} call ULTIMATE.init(); {17774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {17774#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {17762#true} assume true; {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17762#true} {17762#true} #94#return; {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {17762#true} call #t~ret17 := main(); {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {17762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {17762#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {17762#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {17762#true} is VALID [2022-04-28 03:43:25,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {17762#true} ~z~0 := ~y~0; {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:25,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17768#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:25,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {17768#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {17769#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:25,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {17769#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17771#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {17771#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17772#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:43:25,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {17772#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17773#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {17773#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17773#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {17773#(<= main_~y~0 (+ 4294967292 (* (div main_~y~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; {17772#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:43:25,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {17772#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 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; {17771#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {17771#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~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; {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:25,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {17770#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17763#false} is VALID [2022-04-28 03:43:25,413 INFO L272 TraceCheckUtils]: 26: Hoare triple {17763#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17763#false} is VALID [2022-04-28 03:43:25,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {17763#false} ~cond := #in~cond; {17763#false} is VALID [2022-04-28 03:43:25,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {17763#false} assume 0 == ~cond; {17763#false} is VALID [2022-04-28 03:43:25,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {17763#false} assume !false; {17763#false} is VALID [2022-04-28 03:43:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:25,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475838402] [2022-04-28 03:43:25,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475838402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:25,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513256795] [2022-04-28 03:43:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:25,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:25,416 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 03:43:25,417 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 03:43:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:25,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:43:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:25,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:25,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {17762#true} call ULTIMATE.init(); {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {17762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {17762#true} assume true; {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17762#true} {17762#true} #94#return; {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {17762#true} call #t~ret17 := main(); {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {17762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {17762#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17762#true} is VALID [2022-04-28 03:43:25,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {17762#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {17762#true} is VALID [2022-04-28 03:43:25,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {17762#true} ~z~0 := ~y~0; {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:25,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17805#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:25,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {17805#(= 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; {17809#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:43:25,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {17809#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17813#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:43:25,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {17813#(= main_~y~0 (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {17813#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:43:25,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {17813#(= main_~y~0 (+ main_~z~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; {17805#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:25,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {17805#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17823#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:43:25,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {17823#(= main_~z~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; {17827#(= main_~z~0 (+ main_~y~0 3))} is VALID [2022-04-28 03:43:25,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {17827#(= main_~z~0 (+ main_~y~0 3))} assume !(~y~0 % 4294967296 > 0); {17827#(= main_~z~0 (+ main_~y~0 3))} is VALID [2022-04-28 03:43:25,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {17827#(= main_~z~0 (+ 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; {17834#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-28 03:43:25,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {17834#(= (+ main_~y~0 2) main_~z~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; {17823#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:43:25,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {17823#(= main_~z~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; {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:25,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~x~0 % 4294967296 > 0); {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:25,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {17767#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17763#false} is VALID [2022-04-28 03:43:25,594 INFO L272 TraceCheckUtils]: 26: Hoare triple {17763#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17763#false} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {17763#false} ~cond := #in~cond; {17763#false} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {17763#false} assume 0 == ~cond; {17763#false} is VALID [2022-04-28 03:43:25,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {17763#false} assume !false; {17763#false} is VALID [2022-04-28 03:43:25,594 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 03:43:25,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:25,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {17763#false} assume !false; {17763#false} is VALID [2022-04-28 03:43:25,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {17763#false} assume 0 == ~cond; {17763#false} is VALID [2022-04-28 03:43:25,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {17763#false} ~cond := #in~cond; {17763#false} is VALID [2022-04-28 03:43:25,894 INFO L272 TraceCheckUtils]: 26: Hoare triple {17763#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17763#false} is VALID [2022-04-28 03:43:25,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17763#false} is VALID [2022-04-28 03:43:25,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {17847#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17847#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:25,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {17903#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod main_~z~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; {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {17907#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (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; {17903#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:43:25,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {17911#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (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; {17907#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 03:43:25,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {17911#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17911#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-28 03:43:25,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {17918#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (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; {17911#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-28 03:43:25,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {17922#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (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; {17918#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 03:43:25,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {17926#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 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; {17922#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:43:25,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {17926#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17926#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {17933#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17926#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {17937#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17933#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17937#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {17762#true} ~z~0 := ~y~0; {17896#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {17762#true} [143] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {17762#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {17762#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {17762#true} call #t~ret17 := main(); {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17762#true} {17762#true} #94#return; {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {17762#true} assume true; {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {17762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {17762#true} call ULTIMATE.init(); {17762#true} is VALID [2022-04-28 03:43:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:25,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513256795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:25,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:25,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2022-04-28 03:43:26,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [130755856] [2022-04-28 03:43:26,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [130755856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:26,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:26,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:43:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991847618] [2022-04-28 03:43:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-28 03:43:26,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:26,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 03:43:26,086 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 03:43:26,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:43:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:43:26,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:43:26,087 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 03:43:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:28,585 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2022-04-28 03:43:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:43:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-28 03:43:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 03:43:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 111 transitions. [2022-04-28 03:43:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 03:43:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 111 transitions. [2022-04-28 03:43:28,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 111 transitions. [2022-04-28 03:43:28,716 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 03:43:28,717 INFO L225 Difference]: With dead ends: 160 [2022-04-28 03:43:28,717 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 03:43:28,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=470, Invalid=2500, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:43:28,718 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:28,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 62 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:43:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 03:43:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2022-04-28 03:43:29,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:29,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 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 03:43:29,238 INFO L74 IsIncluded]: Start isIncluded. First operand 155 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 03:43:29,238 INFO L87 Difference]: Start difference. First operand 155 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 03:43:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:29,251 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2022-04-28 03:43:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-04-28 03:43:29,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:29,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:29,257 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 155 states. [2022-04-28 03:43:29,257 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 155 states. [2022-04-28 03:43:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:29,258 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2022-04-28 03:43:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-04-28 03:43:29,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:29,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:29,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:29,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:29,259 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 03:43:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2022-04-28 03:43:29,260 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 32 [2022-04-28 03:43:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:29,260 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2022-04-28 03:43:29,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 03:43:29,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 167 transitions. [2022-04-28 03:43:32,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2022-04-28 03:43:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:43:32,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:32,955 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:32,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:43:33,173 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -392481723, now seen corresponding path program 6 times [2022-04-28 03:43:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1949851029] [2022-04-28 03:43:33,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:33,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:33,446 INFO L85 PathProgramCache]: Analyzing trace with hash -555573754, now seen corresponding path program 1 times [2022-04-28 03:43:33,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768658469] [2022-04-28 03:43:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:33,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:33,455 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:33,472 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:33,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {18914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {18902#true} assume true; {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18902#true} {18902#true} #94#return; {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {18902#true} call ULTIMATE.init(); {18914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:33,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {18914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {18902#true} assume true; {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18902#true} {18902#true} #94#return; {18902#true} is VALID [2022-04-28 03:43:33,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {18902#true} call #t~ret17 := main(); {18902#true} is VALID [2022-04-28 03:43:33,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {18902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18902#true} is VALID [2022-04-28 03:43:33,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {18902#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18902#true} is VALID [2022-04-28 03:43:33,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {18902#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {18907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:33,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {18907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {18907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:33,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {18907#(<= 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; {18908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:33,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {18908#(<= 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; {18909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:33,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {18909#(<= 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; {18910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:33,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {18910#(<= 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; {18911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:33,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {18911#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {18912#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {18912#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {18912#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {18912#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {18912#(<= 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; {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {18912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:33,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {18912#(<= 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; {18913#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {18913#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {18903#false} assume !(~z~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {18903#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {18903#false} assume !(~y~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L272 TraceCheckUtils]: 26: Hoare triple {18903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {18903#false} ~cond := #in~cond; {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {18903#false} assume 0 == ~cond; {18903#false} is VALID [2022-04-28 03:43:33,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {18903#false} assume !false; {18903#false} is VALID [2022-04-28 03:43:33,561 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 03:43:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768658469] [2022-04-28 03:43:33,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768658469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952195648] [2022-04-28 03:43:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:33,567 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 03:43:33,568 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 03:43:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:33,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:43:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:33,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:33,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {18902#true} call ULTIMATE.init(); {18902#true} is VALID [2022-04-28 03:43:33,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {18902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18902#true} is VALID [2022-04-28 03:43:33,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {18902#true} assume true; {18902#true} is VALID [2022-04-28 03:43:33,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18902#true} {18902#true} #94#return; {18902#true} is VALID [2022-04-28 03:43:33,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {18902#true} call #t~ret17 := main(); {18902#true} is VALID [2022-04-28 03:43:33,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {18902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18902#true} is VALID [2022-04-28 03:43:33,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {18902#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18902#true} is VALID [2022-04-28 03:43:33,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {18902#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {18902#true} is VALID [2022-04-28 03:43:33,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {18902#true} ~z~0 := ~y~0; {18902#true} is VALID [2022-04-28 03:43:33,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {18902#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:33,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18949#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:33,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {18949#(< 0 (mod (+ main_~z~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; {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:33,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:33,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:33,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:33,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:33,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {18957#(< 0 (mod (+ main_~z~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; {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:33,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {18953#(< 0 (mod (+ main_~z~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; {18949#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:33,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {18949#(< 0 (mod (+ main_~z~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; {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:33,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {18945#(< 0 (mod (+ main_~z~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; {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {18980#(< 0 (mod main_~z~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; {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {18903#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {18903#false} assume !(~y~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L272 TraceCheckUtils]: 26: Hoare triple {18903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {18903#false} ~cond := #in~cond; {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {18903#false} assume 0 == ~cond; {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {18903#false} assume !false; {18903#false} is VALID [2022-04-28 03:43:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:33,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:33,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {18903#false} assume !false; {18903#false} is VALID [2022-04-28 03:43:33,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {18903#false} assume 0 == ~cond; {18903#false} is VALID [2022-04-28 03:43:33,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {18903#false} ~cond := #in~cond; {18903#false} is VALID [2022-04-28 03:43:33,878 INFO L272 TraceCheckUtils]: 26: Hoare triple {18903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18903#false} is VALID [2022-04-28 03:43:33,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {18903#false} assume !(~y~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {18903#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18903#false} is VALID [2022-04-28 03:43:33,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18903#false} is VALID [2022-04-28 03:43:33,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {18980#(< 0 (mod main_~z~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; {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {18945#(< 0 (mod (+ main_~z~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; {18980#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:33,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {18949#(< 0 (mod (+ main_~z~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; {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:33,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {18953#(< 0 (mod (+ main_~z~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; {18949#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:33,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {18957#(< 0 (mod (+ main_~z~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; {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:33,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:33,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:33,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18961#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:33,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18957#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:33,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {18949#(< 0 (mod (+ main_~z~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; {18953#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:33,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18949#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:33,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {18902#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18945#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {18902#true} ~z~0 := ~y~0; {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {18902#true} [145] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {18902#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {18902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {18902#true} call #t~ret17 := main(); {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18902#true} {18902#true} #94#return; {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {18902#true} assume true; {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {18902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {18902#true} call ULTIMATE.init(); {18902#true} is VALID [2022-04-28 03:43:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:33,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952195648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:33,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:33,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-28 03:43:34,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1949851029] [2022-04-28 03:43:34,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1949851029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:34,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:34,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:43:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252614500] [2022-04-28 03:43:34,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 32 [2022-04-28 03:43:34,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:34,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 03:43:34,040 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 03:43:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:43:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:43:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:34,041 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 03:43:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:37,529 INFO L93 Difference]: Finished difference Result 357 states and 512 transitions. [2022-04-28 03:43:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:43:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 32 [2022-04-28 03:43:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 03:43:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2022-04-28 03:43:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 03:43:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2022-04-28 03:43:37,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 148 transitions. [2022-04-28 03:43:37,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:37,654 INFO L225 Difference]: With dead ends: 357 [2022-04-28 03:43:37,654 INFO L226 Difference]: Without dead ends: 312 [2022-04-28 03:43:37,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:43:37,656 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 150 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:37,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 72 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:43:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-28 03:43:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 132. [2022-04-28 03:43:38,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:38,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:38,221 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:38,221 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:38,224 INFO L93 Difference]: Finished difference Result 312 states and 433 transitions. [2022-04-28 03:43:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 433 transitions. [2022-04-28 03:43:38,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:38,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:38,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states 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 03:43:38,246 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states 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 03:43:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:38,250 INFO L93 Difference]: Finished difference Result 312 states and 433 transitions. [2022-04-28 03:43:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 433 transitions. [2022-04-28 03:43:38,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:38,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:38,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:38,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions. [2022-04-28 03:43:38,252 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 32 [2022-04-28 03:43:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:38,252 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 181 transitions. [2022-04-28 03:43:38,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 03:43:38,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 181 transitions. [2022-04-28 03:43:43,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions. [2022-04-28 03:43:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:43:43,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:43,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:43,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:43,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:43,320 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 425178919, now seen corresponding path program 9 times [2022-04-28 03:43:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:43,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043158697] [2022-04-28 03:43:43,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:43,485 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -329171642, now seen corresponding path program 1 times [2022-04-28 03:43:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:43,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286883376] [2022-04-28 03:43:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:43,495 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:43,516 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:43,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {20745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20731#true} is VALID [2022-04-28 03:43:43,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {20731#true} assume true; {20731#true} is VALID [2022-04-28 03:43:43,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20731#true} {20731#true} #94#return; {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {20731#true} call ULTIMATE.init(); {20745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {20745#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {20731#true} assume true; {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20731#true} {20731#true} #94#return; {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {20731#true} call #t~ret17 := main(); {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {20731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {20731#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {20731#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20731#true} is VALID [2022-04-28 03:43:43,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {20731#true} ~z~0 := ~y~0; {20731#true} is VALID [2022-04-28 03:43:43,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {20731#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:43,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {20737#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:43,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {20737#(<= main_~z~0 (+ (* (div main_~z~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; {20738#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:43,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {20738#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {20739#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:43,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {20739#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20739#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:43,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {20739#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20740#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:43,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {20740#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20741#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:43:43,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {20741#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20742#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:43,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {20742#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:43:43,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {20743#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20744#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:43,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {20744#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {20732#false} assume !(~y~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L272 TraceCheckUtils]: 27: Hoare triple {20732#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {20732#false} ~cond := #in~cond; {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {20732#false} assume 0 == ~cond; {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {20732#false} assume !false; {20732#false} is VALID [2022-04-28 03:43:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:43:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286883376] [2022-04-28 03:43:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286883376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238857129] [2022-04-28 03:43:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:43,656 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 03:43:43,678 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 03:43:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:43,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:43:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:43,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:44,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {20731#true} call ULTIMATE.init(); {20731#true} is VALID [2022-04-28 03:43:44,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {20731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {20731#true} assume true; {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20731#true} {20731#true} #94#return; {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {20731#true} call #t~ret17 := main(); {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {20731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {20731#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {20731#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20731#true} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {20731#true} ~z~0 := ~y~0; {20773#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:44,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {20773#(= 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; {20777#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:44,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {20777#(= 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; {20781#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:44,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {20781#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20785#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:44,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {20785#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 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; {20789#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:44,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {20789#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {20789#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:44,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {20789#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~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; {20796#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 3) (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:44,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {20796#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~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; {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:44,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:44,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:44,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {20732#false} assume !(~y~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:44,109 INFO L272 TraceCheckUtils]: 27: Hoare triple {20732#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20732#false} is VALID [2022-04-28 03:43:44,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {20732#false} ~cond := #in~cond; {20732#false} is VALID [2022-04-28 03:43:44,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {20732#false} assume 0 == ~cond; {20732#false} is VALID [2022-04-28 03:43:44,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {20732#false} assume !false; {20732#false} is VALID [2022-04-28 03:43:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:43:44,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:44,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {20732#false} assume !false; {20732#false} is VALID [2022-04-28 03:43:44,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {20732#false} assume 0 == ~cond; {20732#false} is VALID [2022-04-28 03:43:44,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {20732#false} ~cond := #in~cond; {20732#false} is VALID [2022-04-28 03:43:44,260 INFO L272 TraceCheckUtils]: 27: Hoare triple {20732#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20732#false} is VALID [2022-04-28 03:43:44,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {20732#false} assume !(~y~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:44,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20732#false} is VALID [2022-04-28 03:43:44,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:44,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20807#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:43:44,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20803#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:43:44,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {20892#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {20896#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20892#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:44,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {20896#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20896#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {20892#(<= main_~z~0 (+ (* (div (+ main_~z~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; {20896#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {20892#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:44,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {20731#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20736#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:44,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {20731#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20731#true} is VALID [2022-04-28 03:43:44,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {20731#true} ~z~0 := ~y~0; {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {20731#true} [147] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {20731#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {20731#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {20731#true} call #t~ret17 := main(); {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20731#true} {20731#true} #94#return; {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {20731#true} assume true; {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {20731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {20731#true} call ULTIMATE.init(); {20731#true} is VALID [2022-04-28 03:43:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:43:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238857129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:44,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:44,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 7] total 22 [2022-04-28 03:43:44,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:44,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043158697] [2022-04-28 03:43:44,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043158697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:44,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:44,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:43:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393086669] [2022-04-28 03:43:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:44,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 33 [2022-04-28 03:43:44,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:44,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 03:43:44,366 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 03:43:44,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:43:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:43:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:43:44,367 INFO L87 Difference]: Start difference. First operand 132 states and 181 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 03:43:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:46,864 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2022-04-28 03:43:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:43:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 33 [2022-04-28 03:43:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 03:43:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 91 transitions. [2022-04-28 03:43:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 03:43:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 91 transitions. [2022-04-28 03:43:46,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 91 transitions. [2022-04-28 03:43:46,968 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 03:43:46,970 INFO L225 Difference]: With dead ends: 200 [2022-04-28 03:43:46,970 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 03:43:46,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:43:46,971 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:46,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 58 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:43:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 03:43:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2022-04-28 03:43:47,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:47,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:47,602 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:47,602 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:47,604 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2022-04-28 03:43:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2022-04-28 03:43:47,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:47,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:47,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states 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 03:43:47,605 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states 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 03:43:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:47,607 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2022-04-28 03:43:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2022-04-28 03:43:47,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:47,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:47,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:47,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2022-04-28 03:43:47,609 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 33 [2022-04-28 03:43:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:47,609 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2022-04-28 03:43:47,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 03:43:47,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 184 transitions. [2022-04-28 03:43:51,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 183 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2022-04-28 03:43:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:43:51,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:51,607 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:51,624 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 03:43:51,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:51,808 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 503233447, now seen corresponding path program 7 times [2022-04-28 03:43:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390245768] [2022-04-28 03:43:52,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:52,045 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -244582010, now seen corresponding path program 1 times [2022-04-28 03:43:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:52,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901640165] [2022-04-28 03:43:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:52,057 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {22046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {22033#true} assume true; {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22033#true} {22033#true} #94#return; {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {22033#true} call ULTIMATE.init(); {22046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:52,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {22046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {22033#true} assume true; {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22033#true} {22033#true} #94#return; {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {22033#true} call #t~ret17 := main(); {22033#true} is VALID [2022-04-28 03:43:52,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {22033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22033#true} is VALID [2022-04-28 03:43:52,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {22033#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22033#true} is VALID [2022-04-28 03:43:52,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {22033#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {22038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:52,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {22038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {22038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:52,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {22038#(<= 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; {22039#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:52,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {22039#(<= 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; {22040#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {22040#(<= 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; {22041#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {22041#(<= 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; {22042#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {22042#(<= 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; {22043#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:52,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {22043#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {22044#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {22044#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {22044#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {22044#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {22044#(<= 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; {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22044#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:52,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {22044#(<= 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; {22045#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {22045#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {22034#false} assume !(~z~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {22034#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {22034#false} assume !(~y~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {22034#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {22034#false} ~cond := #in~cond; {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {22034#false} assume 0 == ~cond; {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {22034#false} assume !false; {22034#false} is VALID [2022-04-28 03:43:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:43:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901640165] [2022-04-28 03:43:52,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901640165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:52,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230850227] [2022-04-28 03:43:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:52,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:52,212 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 03:43:52,213 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 03:43:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:43:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:52,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {22033#true} call ULTIMATE.init(); {22033#true} is VALID [2022-04-28 03:43:52,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {22033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22033#true} is VALID [2022-04-28 03:43:52,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {22033#true} assume true; {22033#true} is VALID [2022-04-28 03:43:52,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22033#true} {22033#true} #94#return; {22033#true} is VALID [2022-04-28 03:43:52,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {22033#true} call #t~ret17 := main(); {22033#true} is VALID [2022-04-28 03:43:52,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {22033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22033#true} is VALID [2022-04-28 03:43:52,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {22033#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22033#true} is VALID [2022-04-28 03:43:52,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {22033#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {22033#true} is VALID [2022-04-28 03:43:52,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {22033#true} ~z~0 := ~y~0; {22074#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:52,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {22074#(= 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; {22078#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:52,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {22078#(= 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; {22082#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:52,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {22082#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22086#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:52,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {22086#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 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; {22090#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 03:43:52,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {22090#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22094#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:52,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {22094#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 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; {22098#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:52,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {22098#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22098#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:52,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {22098#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 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; {22105#(and (= (+ main_~y~0 (- 4)) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:52,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {22105#(and (= (+ main_~y~0 (- 4)) main_~z~0) (< 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; {22109#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:52,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {22109#(< 0 (mod (+ main_~z~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; {22113#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:52,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {22113#(< 0 (mod (+ main_~z~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; {22117#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:52,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {22117#(< 0 (mod (+ main_~z~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; {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {22121#(< 0 (mod main_~z~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; {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {22034#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {22034#false} assume !(~y~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L272 TraceCheckUtils]: 27: Hoare triple {22034#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {22034#false} ~cond := #in~cond; {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {22034#false} assume 0 == ~cond; {22034#false} is VALID [2022-04-28 03:43:52,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {22034#false} assume !false; {22034#false} is VALID [2022-04-28 03:43:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:52,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:52,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {22034#false} assume !false; {22034#false} is VALID [2022-04-28 03:43:52,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {22034#false} assume 0 == ~cond; {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {22034#false} ~cond := #in~cond; {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L272 TraceCheckUtils]: 27: Hoare triple {22034#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {22034#false} assume !(~y~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {22034#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22034#false} is VALID [2022-04-28 03:43:52,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {22121#(< 0 (mod main_~z~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; {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {22121#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {22117#(< 0 (mod (+ main_~z~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; {22121#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:52,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {22113#(< 0 (mod (+ main_~z~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; {22117#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:52,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {22109#(< 0 (mod (+ main_~z~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; {22113#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:52,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {22191#(< 0 (mod (+ main_~z~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; {22109#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:52,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {22195#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22191#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:52,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {22195#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22195#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:52,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {22191#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22195#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:52,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {22109#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22191#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:43:52,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {22113#(< 0 (mod (+ main_~z~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; {22109#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:43:52,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {22117#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22113#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:43:52,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {22033#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22117#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:43:52,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {22033#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22033#true} is VALID [2022-04-28 03:43:52,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {22033#true} ~z~0 := ~y~0; {22033#true} is VALID [2022-04-28 03:43:52,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {22033#true} [149] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {22033#true} is VALID [2022-04-28 03:43:52,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {22033#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22033#true} is VALID [2022-04-28 03:43:52,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {22033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22033#true} is VALID [2022-04-28 03:43:52,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {22033#true} call #t~ret17 := main(); {22033#true} is VALID [2022-04-28 03:43:52,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22033#true} {22033#true} #94#return; {22033#true} is VALID [2022-04-28 03:43:52,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {22033#true} assume true; {22033#true} is VALID [2022-04-28 03:43:52,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {22033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22033#true} is VALID [2022-04-28 03:43:52,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {22033#true} call ULTIMATE.init(); {22033#true} is VALID [2022-04-28 03:43:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:52,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230850227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:52,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:52,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 8] total 25 [2022-04-28 03:43:52,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:52,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390245768] [2022-04-28 03:43:52,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390245768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:43:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374451322] [2022-04-28 03:43:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 33 [2022-04-28 03:43:52,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:52,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:52,859 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 03:43:52,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:43:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:52,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:43:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:43:52,860 INFO L87 Difference]: Start difference. First operand 135 states and 184 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:57,516 INFO L93 Difference]: Finished difference Result 402 states and 570 transitions. [2022-04-28 03:43:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:43:57,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 33 [2022-04-28 03:43:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-04-28 03:43:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-04-28 03:43:57,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 159 transitions. [2022-04-28 03:43:57,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:57,653 INFO L225 Difference]: With dead ends: 402 [2022-04-28 03:43:57,653 INFO L226 Difference]: Without dead ends: 354 [2022-04-28 03:43:57,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:43:57,654 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 196 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:57,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 63 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:43:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-28 03:43:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 145. [2022-04-28 03:43:58,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:58,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 03:43:58,329 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 03:43:58,329 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 03:43:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:58,334 INFO L93 Difference]: Finished difference Result 354 states and 485 transitions. [2022-04-28 03:43:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2022-04-28 03:43:58,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:58,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:58,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 354 states. [2022-04-28 03:43:58,335 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 354 states. [2022-04-28 03:43:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:58,339 INFO L93 Difference]: Finished difference Result 354 states and 485 transitions. [2022-04-28 03:43:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2022-04-28 03:43:58,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:58,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:58,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:58,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 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 03:43:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-04-28 03:43:58,341 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 33 [2022-04-28 03:43:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:58,341 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-04-28 03:43:58,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:43:58,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 198 transitions. [2022-04-28 03:44:03,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 197 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-04-28 03:44:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:44:03,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:03,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:03,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:03,473 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,SelfDestructingSolverStorable30 [2022-04-28 03:44:03,473 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -893507562, now seen corresponding path program 10 times [2022-04-28 03:44:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:03,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025811373] [2022-04-28 03:44:05,690 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:05,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:05,791 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1896605271, now seen corresponding path program 1 times [2022-04-28 03:44:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:05,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997398666] [2022-04-28 03:44:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:05,803 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:05,814 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:05,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {24092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24079#true} is VALID [2022-04-28 03:44:05,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {24079#true} assume true; {24079#true} is VALID [2022-04-28 03:44:05,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24079#true} {24079#true} #94#return; {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {24079#true} call ULTIMATE.init(); {24092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:05,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {24092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {24079#true} assume true; {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24079#true} {24079#true} #94#return; {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {24079#true} call #t~ret17 := main(); {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {24079#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {24079#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24079#true} is VALID [2022-04-28 03:44:05,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {24079#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {24079#true} is VALID [2022-04-28 03:44:05,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {24079#true} ~z~0 := ~y~0; {24084#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:05,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {24084#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24085#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:05,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {24085#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24086#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:05,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {24086#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24087#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:05,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {24087#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:05,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:05,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24089#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:05,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {24089#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24090#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:05,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {24090#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24091#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {24091#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {24080#false} assume !(~x~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {24080#false} assume !(~z~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {24080#false} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L272 TraceCheckUtils]: 28: Hoare triple {24080#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24080#false} is VALID [2022-04-28 03:44:05,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {24080#false} ~cond := #in~cond; {24080#false} is VALID [2022-04-28 03:44:05,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {24080#false} assume 0 == ~cond; {24080#false} is VALID [2022-04-28 03:44:05,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {24080#false} assume !false; {24080#false} is VALID [2022-04-28 03:44:05,925 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 03:44:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997398666] [2022-04-28 03:44:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997398666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972660483] [2022-04-28 03:44:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:05,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:05,926 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 03:44:05,927 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 03:44:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:05,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:44:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:05,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:06,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {24079#true} call ULTIMATE.init(); {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {24079#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {24079#true} assume true; {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24079#true} {24079#true} #94#return; {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {24079#true} call #t~ret17 := main(); {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {24079#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24079#true} is VALID [2022-04-28 03:44:06,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {24079#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24079#true} is VALID [2022-04-28 03:44:06,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {24079#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {24079#true} is VALID [2022-04-28 03:44:06,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {24079#true} ~z~0 := ~y~0; {24084#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:06,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {24084#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24085#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:06,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {24085#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24086#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:06,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {24086#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24087#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:06,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {24087#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24132#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:06,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {24132#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {24132#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:06,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {24132#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24139#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:06,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {24139#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24143#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {24143#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~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; {24147#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {24147#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {24080#false} assume !(~x~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {24080#false} assume !(~z~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {24080#false} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L272 TraceCheckUtils]: 28: Hoare triple {24080#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {24080#false} ~cond := #in~cond; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {24080#false} assume 0 == ~cond; {24080#false} is VALID [2022-04-28 03:44:06,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {24080#false} assume !false; {24080#false} is VALID [2022-04-28 03:44:06,274 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 03:44:06,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:06,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {24080#false} assume !false; {24080#false} is VALID [2022-04-28 03:44:06,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {24080#false} assume 0 == ~cond; {24080#false} is VALID [2022-04-28 03:44:06,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {24080#false} ~cond := #in~cond; {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L272 TraceCheckUtils]: 28: Hoare triple {24080#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {24080#false} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {24080#false} assume !(~z~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {24080#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24080#false} is VALID [2022-04-28 03:44:06,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {24080#false} assume !(~x~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {24080#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; {24080#false} is VALID [2022-04-28 03:44:06,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {24091#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24080#false} is VALID [2022-04-28 03:44:06,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {24090#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24091#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:06,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {24089#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24090#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:06,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24089#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:06,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:06,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {24250#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (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; {24088#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:06,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {24254#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24250#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:44:06,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {24258#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24254#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:44:06,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {24262#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24258#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:44:06,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {24079#true} ~z~0 := ~y~0; {24262#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:44:06,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {24079#true} [151] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {24079#true} is VALID [2022-04-28 03:44:06,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {24079#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {24079#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {24079#true} call #t~ret17 := main(); {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24079#true} {24079#true} #94#return; {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {24079#true} assume true; {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {24079#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {24079#true} call ULTIMATE.init(); {24079#true} is VALID [2022-04-28 03:44:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:44:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972660483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:06,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:06,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 03:44:06,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025811373] [2022-04-28 03:44:06,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025811373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:06,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:06,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:44:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344826423] [2022-04-28 03:44:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:06,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:06,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:06,813 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 03:44:06,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:44:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:44:06,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:44:06,814 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:10,275 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2022-04-28 03:44:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:44:10,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2022-04-28 03:44:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2022-04-28 03:44:10,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 100 transitions. [2022-04-28 03:44:10,424 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 03:44:10,426 INFO L225 Difference]: With dead ends: 217 [2022-04-28 03:44:10,426 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 03:44:10,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:44:10,427 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 60 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:10,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 80 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:44:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 03:44:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2022-04-28 03:44:11,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:11,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,257 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,257 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:11,279 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2022-04-28 03:44:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2022-04-28 03:44:11,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:11,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:11,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-28 03:44:11,279 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 172 states. [2022-04-28 03:44:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:11,281 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2022-04-28 03:44:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2022-04-28 03:44:11,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:11,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:11,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:11,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2022-04-28 03:44:11,283 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 34 [2022-04-28 03:44:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:11,283 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2022-04-28 03:44:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 03:44:11,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 175 transitions. [2022-04-28 03:44:19,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 173 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2022-04-28 03:44:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:44:19,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:19,354 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:19,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:19,555 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,SelfDestructingSolverStorable31 [2022-04-28 03:44:19,555 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1663345241, now seen corresponding path program 8 times [2022-04-28 03:44:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:19,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618645836] [2022-04-28 03:44:21,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:21,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1329355816, now seen corresponding path program 1 times [2022-04-28 03:44:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:21,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514395421] [2022-04-28 03:44:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:21,732 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:21,760 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:21,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {25408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25393#true} is VALID [2022-04-28 03:44:21,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {25393#true} assume true; {25393#true} is VALID [2022-04-28 03:44:21,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25393#true} {25393#true} #94#return; {25393#true} is VALID [2022-04-28 03:44:21,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {25393#true} call ULTIMATE.init(); {25408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:21,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {25408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {25393#true} assume true; {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25393#true} {25393#true} #94#return; {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {25393#true} call #t~ret17 := main(); {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {25393#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {25393#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {25393#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25393#true} is VALID [2022-04-28 03:44:21,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {25393#true} ~z~0 := ~y~0; {25398#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:21,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {25398#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25399#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:21,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {25399#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25400#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:21,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {25400#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25401#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:21,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {25401#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25402#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:21,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {25402#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {25403#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:44:21,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {25403#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:21,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:21,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:21,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:21,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25394#false} is VALID [2022-04-28 03:44:21,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:21,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {25394#false} assume !(~x~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {25394#false} assume !(~z~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {25394#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L272 TraceCheckUtils]: 28: Hoare triple {25394#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {25394#false} ~cond := #in~cond; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {25394#false} assume 0 == ~cond; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {25394#false} assume !false; {25394#false} is VALID [2022-04-28 03:44:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:44:21,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514395421] [2022-04-28 03:44:21,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514395421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279267071] [2022-04-28 03:44:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:21,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:21,916 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 03:44:21,943 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 03:44:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:21,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:44:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:21,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:22,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {25393#true} call ULTIMATE.init(); {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {25393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {25393#true} assume true; {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25393#true} {25393#true} #94#return; {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {25393#true} call #t~ret17 := main(); {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {25393#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {25393#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25393#true} is VALID [2022-04-28 03:44:22,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {25393#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25393#true} is VALID [2022-04-28 03:44:22,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {25393#true} ~z~0 := ~y~0; {25398#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:22,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {25398#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25399#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:22,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {25399#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25400#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:22,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {25400#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25401#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:22,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {25401#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25402#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:22,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {25402#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {25451#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:44:22,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {25451#(<= (div (+ (* (- 1) main_~y~0) 4) (- 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; {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:22,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {25394#false} assume !(~x~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {25394#false} assume !(~z~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {25394#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L272 TraceCheckUtils]: 28: Hoare triple {25394#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {25394#false} ~cond := #in~cond; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {25394#false} assume 0 == ~cond; {25394#false} is VALID [2022-04-28 03:44:22,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {25394#false} assume !false; {25394#false} is VALID [2022-04-28 03:44:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:44:22,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {25394#false} assume !false; {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {25394#false} assume 0 == ~cond; {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {25394#false} ~cond := #in~cond; {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {25394#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {25394#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {25394#false} assume !(~z~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {25394#false} assume !(~x~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:23,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:23,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:23,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {25394#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; {25394#false} is VALID [2022-04-28 03:44:23,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {25394#false} assume !(~y~0 % 4294967296 > 0); {25394#false} is VALID [2022-04-28 03:44:23,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25394#false} is VALID [2022-04-28 03:44:23,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25407#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:23,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25406#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:23,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25405#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:23,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {25451#(<= (div (+ (* (- 1) main_~y~0) 4) (- 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; {25404#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:23,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {25560#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {25451#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:44:23,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {25564#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {25560#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:23,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {25568#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25564#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:23,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {25572#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {25568#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:44:23,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {25576#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25572#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {25393#true} ~z~0 := ~y~0; {25576#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {25393#true} [153] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {25393#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {25393#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {25393#true} call #t~ret17 := main(); {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25393#true} {25393#true} #94#return; {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {25393#true} assume true; {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {25393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {25393#true} call ULTIMATE.init(); {25393#true} is VALID [2022-04-28 03:44:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:44:23,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279267071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:23,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:23,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-28 03:44:23,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618645836] [2022-04-28 03:44:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618645836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:23,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:23,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:44:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158213286] [2022-04-28 03:44:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 34 [2022-04-28 03:44:23,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:23,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:23,152 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 03:44:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:44:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:44:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:44:23,153 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:26,461 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2022-04-28 03:44:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:44:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 34 [2022-04-28 03:44:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 127 transitions. [2022-04-28 03:44:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 127 transitions. [2022-04-28 03:44:26,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 127 transitions. [2022-04-28 03:44:26,597 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 03:44:26,599 INFO L225 Difference]: With dead ends: 285 [2022-04-28 03:44:26,599 INFO L226 Difference]: Without dead ends: 176 [2022-04-28 03:44:26,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=2506, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:44:26,600 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:26,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:44:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-28 03:44:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2022-04-28 03:44:27,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:27,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 03:44:27,871 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 03:44:27,871 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 03:44:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,873 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2022-04-28 03:44:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2022-04-28 03:44:27,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:27,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:27,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 176 states. [2022-04-28 03:44:27,874 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 176 states. [2022-04-28 03:44:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,876 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2022-04-28 03:44:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2022-04-28 03:44:27,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:27,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:27,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:27,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 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 03:44:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2022-04-28 03:44:27,878 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 34 [2022-04-28 03:44:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:27,878 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2022-04-28 03:44:27,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:27,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 178 transitions. [2022-04-28 03:44:34,319 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 03:44:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2022-04-28 03:44:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:44:34,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:34,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:34,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:34,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:34,520 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 6 times [2022-04-28 03:44:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:34,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1478228026] [2022-04-28 03:44:34,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:34,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 558989945, now seen corresponding path program 1 times [2022-04-28 03:44:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:34,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135656677] [2022-04-28 03:44:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:34,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:34,746 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:34,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26870#true} is VALID [2022-04-28 03:44:34,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {26870#true} assume true; {26870#true} is VALID [2022-04-28 03:44:34,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26870#true} {26870#true} #94#return; {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {26870#true} call ULTIMATE.init(); {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:34,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {26870#true} assume true; {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26870#true} {26870#true} #94#return; {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {26870#true} call #t~ret17 := main(); {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {26870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26870#true} is VALID [2022-04-28 03:44:34,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {26870#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26870#true} is VALID [2022-04-28 03:44:34,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {26870#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {26875#(<= 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; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:34,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {26876#(<= 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; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {26877#(<= 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; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {26878#(<= 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; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {26878#(<= 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; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {26878#(<= 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; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {26878#(<= 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; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {26877#(<= 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; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:34,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {26876#(<= 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; {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:34,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:34,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:34,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:34,863 INFO L272 TraceCheckUtils]: 29: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:34,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {26879#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26880#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:34,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {26880#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26871#false} is VALID [2022-04-28 03:44:34,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {26871#false} assume !false; {26871#false} is VALID [2022-04-28 03:44:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135656677] [2022-04-28 03:44:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135656677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749738130] [2022-04-28 03:44:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:34,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:34,865 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 03:44:34,866 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 03:44:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:34,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:44:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:34,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:35,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {26870#true} call ULTIMATE.init(); {26870#true} is VALID [2022-04-28 03:44:35,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {26870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26870#true} is VALID [2022-04-28 03:44:35,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {26870#true} assume true; {26870#true} is VALID [2022-04-28 03:44:35,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26870#true} {26870#true} #94#return; {26870#true} is VALID [2022-04-28 03:44:35,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {26870#true} call #t~ret17 := main(); {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {26870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {26870#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {26870#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {26870#true} ~z~0 := ~y~0; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {26870#true} assume !(~z~0 % 4294967296 > 0); {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {26870#true} assume !(~y~0 % 4294967296 > 0); {26870#true} is VALID [2022-04-28 03:44:35,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {26870#true} assume !(~x~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:35,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:35,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,132 INFO L272 TraceCheckUtils]: 29: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26972#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:35,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {26972#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26976#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:35,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {26976#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26871#false} is VALID [2022-04-28 03:44:35,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {26871#false} assume !false; {26871#false} is VALID [2022-04-28 03:44:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 03:44:35,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:35,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {26871#false} assume !false; {26871#false} is VALID [2022-04-28 03:44:35,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {26976#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26871#false} is VALID [2022-04-28 03:44:35,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {26972#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26976#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:35,395 INFO L272 TraceCheckUtils]: 29: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26972#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:35,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:35,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26878#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26877#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26876#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {26870#true} assume !(~x~0 % 4294967296 > 0); {26875#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {26870#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#true} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {26870#true} assume !(~y~0 % 4294967296 > 0); {26870#true} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {26870#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {26870#true} assume !(~z~0 % 4294967296 > 0); {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {26870#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {26870#true} ~z~0 := ~y~0; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {26870#true} [155] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {26870#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {26870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {26870#true} call #t~ret17 := main(); {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26870#true} {26870#true} #94#return; {26870#true} is VALID [2022-04-28 03:44:35,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {26870#true} assume true; {26870#true} is VALID [2022-04-28 03:44:35,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {26870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26870#true} is VALID [2022-04-28 03:44:35,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {26870#true} call ULTIMATE.init(); {26870#true} is VALID [2022-04-28 03:44:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 03:44:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749738130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:35,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:35,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-28 03:44:35,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:35,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1478228026] [2022-04-28 03:44:35,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1478228026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:35,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:35,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:44:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376112826] [2022-04-28 03:44:35,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:35,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 35 [2022-04-28 03:44:35,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:35,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 03:44:35,512 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 03:44:35,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:44:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:44:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:44:35,512 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 03:44:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:38,407 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2022-04-28 03:44:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:44:38,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 35 [2022-04-28 03:44:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 03:44:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-28 03:44:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 03:44:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-28 03:44:38,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-28 03:44:38,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:38,511 INFO L225 Difference]: With dead ends: 214 [2022-04-28 03:44:38,511 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 03:44:38,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:44:38,511 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 81 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:38,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 52 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:44:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 03:44:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 141. [2022-04-28 03:44:39,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:39,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,370 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,370 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:39,372 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2022-04-28 03:44:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-04-28 03:44:39,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:39,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:39,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-28 03:44:39,372 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-28 03:44:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:39,374 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2022-04-28 03:44:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-04-28 03:44:39,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:39,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:39,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:39,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2022-04-28 03:44:39,376 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 35 [2022-04-28 03:44:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:39,377 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2022-04-28 03:44:39,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 03:44:39,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 188 transitions. [2022-04-28 03:44:45,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 187 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2022-04-28 03:44:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:44:45,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:45,914 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:45,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:46,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:46,118 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash 237906376, now seen corresponding path program 9 times [2022-04-28 03:44:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:46,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729699279] [2022-04-28 03:44:50,228 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:50,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:50,319 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1603510150, now seen corresponding path program 1 times [2022-04-28 03:44:50,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:50,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854294799] [2022-04-28 03:44:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:50,331 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {28236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28222#true} is VALID [2022-04-28 03:44:50,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {28222#true} assume true; {28222#true} is VALID [2022-04-28 03:44:50,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28222#true} {28222#true} #94#return; {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {28222#true} call ULTIMATE.init(); {28236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:50,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {28236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {28222#true} assume true; {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28222#true} {28222#true} #94#return; {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {28222#true} call #t~ret17 := main(); {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {28222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28222#true} is VALID [2022-04-28 03:44:50,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {28222#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28222#true} is VALID [2022-04-28 03:44:50,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {28222#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {28227#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:50,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {28227#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28227#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:50,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {28227#(<= 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; {28228#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:50,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {28228#(<= 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; {28229#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {28229#(<= 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; {28230#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {28230#(<= 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; {28231#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {28231#(<= 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; {28232#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:50,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {28232#(<= 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; {28233#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {28233#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {28234#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28235#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:50,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {28235#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {28223#false} assume !(~z~0 % 4294967296 > 0); {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {28223#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {28223#false} assume !(~y~0 % 4294967296 > 0); {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L272 TraceCheckUtils]: 28: Hoare triple {28223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {28223#false} ~cond := #in~cond; {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {28223#false} assume 0 == ~cond; {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {28223#false} assume !false; {28223#false} is VALID [2022-04-28 03:44:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:44:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854294799] [2022-04-28 03:44:50,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854294799] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:50,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796921517] [2022-04-28 03:44:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:50,485 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 03:44:50,486 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 03:44:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:44:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:50,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {28222#true} call ULTIMATE.init(); {28222#true} is VALID [2022-04-28 03:44:50,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {28222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {28222#true} assume true; {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28222#true} {28222#true} #94#return; {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {28222#true} call #t~ret17 := main(); {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {28222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {28222#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {28222#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {28222#true} is VALID [2022-04-28 03:44:50,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {28222#true} ~z~0 := ~y~0; {28264#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:50,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {28264#(= 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; {28268#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:50,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {28268#(= 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; {28272#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:50,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {28272#(= (+ 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; {28276#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:50,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {28276#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28280#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:50,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {28280#(= (+ main_~z~0 3) (+ (- 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; {28284#(= (+ (- 1) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-28 03:44:50,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {28284#(= (+ (- 1) main_~y~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; {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:50,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {28288#(< 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; {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:50,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:50,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {28288#(< 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; {28298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:50,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {28298#(< 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; {28302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:50,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {28302#(< 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; {28306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:50,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {28306#(< 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; {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:50,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {28310#(< 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; {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:50,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {28314#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:50,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {28314#(< 0 (mod main_~y~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; {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:50,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:50,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:50,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:50,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {28314#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28223#false} is VALID [2022-04-28 03:44:50,826 INFO L272 TraceCheckUtils]: 28: Hoare triple {28223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28223#false} is VALID [2022-04-28 03:44:50,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {28223#false} ~cond := #in~cond; {28223#false} is VALID [2022-04-28 03:44:50,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {28223#false} assume 0 == ~cond; {28223#false} is VALID [2022-04-28 03:44:50,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {28223#false} assume !false; {28223#false} is VALID [2022-04-28 03:44:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:50,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:51,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {28223#false} assume !false; {28223#false} is VALID [2022-04-28 03:44:51,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {28223#false} assume 0 == ~cond; {28223#false} is VALID [2022-04-28 03:44:51,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {28223#false} ~cond := #in~cond; {28223#false} is VALID [2022-04-28 03:44:51,216 INFO L272 TraceCheckUtils]: 28: Hoare triple {28223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28223#false} is VALID [2022-04-28 03:44:51,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {28314#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28223#false} is VALID [2022-04-28 03:44:51,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:51,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:51,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:51,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {28314#(< 0 (mod main_~y~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; {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:51,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {28314#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:51,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {28310#(< 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; {28314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:51,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {28306#(< 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; {28310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:51,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {28302#(< 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; {28306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:51,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {28298#(< 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; {28302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:51,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {28288#(< 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; {28298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:51,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:51,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {28288#(< 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; {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:51,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {28396#(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; {28288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:51,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {28400#(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; {28396#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:51,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {28404#(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; {28400#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:51,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {28408#(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; {28404#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:51,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {28412#(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; {28408#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:51,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {28416#(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; {28412#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:51,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {28222#true} ~z~0 := ~y~0; {28416#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:51,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {28222#true} [157] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {28222#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {28222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {28222#true} call #t~ret17 := main(); {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28222#true} {28222#true} #94#return; {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {28222#true} assume true; {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {28222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {28222#true} call ULTIMATE.init(); {28222#true} is VALID [2022-04-28 03:44:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:51,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796921517] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:51,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:51,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 30 [2022-04-28 03:44:51,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729699279] [2022-04-28 03:44:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729699279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:51,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:44:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995824038] [2022-04-28 03:44:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-04-28 03:44:51,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:51,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:51,569 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 03:44:51,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:44:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:44:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:44:51,570 INFO L87 Difference]: Start difference. First operand 141 states and 188 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:57,851 INFO L93 Difference]: Finished difference Result 408 states and 585 transitions. [2022-04-28 03:44:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:44:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-04-28 03:44:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-04-28 03:44:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-04-28 03:44:57,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 188 transitions. [2022-04-28 03:44:58,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:58,153 INFO L225 Difference]: With dead ends: 408 [2022-04-28 03:44:58,153 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 03:44:58,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:44:58,154 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:58,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 89 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:44:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 03:44:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 151. [2022-04-28 03:44:58,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:58,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:58,989 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:58,989 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:58,994 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2022-04-28 03:44:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2022-04-28 03:44:58,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:58,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:58,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-28 03:44:58,996 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-28 03:44:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:59,001 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2022-04-28 03:44:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2022-04-28 03:44:59,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:59,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:59,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:59,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2022-04-28 03:44:59,004 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 35 [2022-04-28 03:44:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:59,004 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-04-28 03:44:59,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 03:44:59,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 202 transitions. [2022-04-28 03:45:11,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 200 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-28 03:45:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:45:11,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:11,187 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:11,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:45:11,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:11,388 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2040976357, now seen corresponding path program 7 times [2022-04-28 03:45:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:11,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957998988] [2022-04-28 03:45:11,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:45:11,560 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 344901350, now seen corresponding path program 1 times [2022-04-28 03:45:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:11,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450186729] [2022-04-28 03:45:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:11,571 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:11,604 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:11,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {30325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30316#true} is VALID [2022-04-28 03:45:11,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {30316#true} assume true; {30316#true} is VALID [2022-04-28 03:45:11,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30316#true} {30316#true} #94#return; {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {30316#true} call ULTIMATE.init(); {30325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:11,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {30325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {30316#true} assume true; {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30316#true} {30316#true} #94#return; {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {30316#true} call #t~ret17 := main(); {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {30316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {30316#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30316#true} is VALID [2022-04-28 03:45:11,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {30316#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30316#true} is VALID [2022-04-28 03:45:11,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {30316#true} ~z~0 := ~y~0; {30316#true} is VALID [2022-04-28 03:45:11,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {30316#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30316#true} is VALID [2022-04-28 03:45:11,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {30316#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30316#true} is VALID [2022-04-28 03:45:11,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {30316#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30316#true} is VALID [2022-04-28 03:45:11,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {30316#true} assume !(~z~0 % 4294967296 > 0); {30321#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:11,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {30321#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30322#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:11,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {30322#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30323#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:45:11,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {30323#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:11,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {30324#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30323#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:45:11,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {30323#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30322#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:11,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {30322#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30321#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {30321#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {30317#false} assume !(~z~0 % 4294967296 > 0); {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {30317#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {30317#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {30317#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {30317#false} assume !(~y~0 % 4294967296 > 0); {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L272 TraceCheckUtils]: 30: Hoare triple {30317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30317#false} is VALID [2022-04-28 03:45:11,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {30317#false} ~cond := #in~cond; {30317#false} is VALID [2022-04-28 03:45:11,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {30317#false} assume 0 == ~cond; {30317#false} is VALID [2022-04-28 03:45:11,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {30317#false} assume !false; {30317#false} is VALID [2022-04-28 03:45:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 03:45:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:11,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450186729] [2022-04-28 03:45:11,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450186729] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:11,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762765873] [2022-04-28 03:45:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:11,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:11,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:11,678 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 03:45:11,679 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 03:45:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:45:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:11,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:11,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {30316#true} call ULTIMATE.init(); {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {30316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {30316#true} assume true; {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30316#true} {30316#true} #94#return; {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {30316#true} call #t~ret17 := main(); {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {30316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {30316#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {30316#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30316#true} is VALID [2022-04-28 03:45:11,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {30316#true} ~z~0 := ~y~0; {30353#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:11,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {30353#(= 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; {30357#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {30357#(= 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; {30361#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:45:11,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {30361#(= (+ 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; {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30357#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {30357#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30375#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:45:11,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {30375#(= main_~z~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; {30379#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:45:11,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {30379#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {30379#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:45:11,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {30379#(= (+ main_~y~0 2) (+ (- 1) main_~z~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; {30386#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:45:11,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {30386#(= (+ (- 1) main_~z~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; {30375#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:45:11,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {30375#(= main_~z~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; {30353#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:11,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {30353#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {30353#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:11,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {30353#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30357#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {30357#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30361#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:45:11,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {30361#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:11,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {30365#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:11,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:11,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30415#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:45:11,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {30415#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30419#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:45:11,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {30419#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30423#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:11,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {30423#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30317#false} is VALID [2022-04-28 03:45:11,978 INFO L272 TraceCheckUtils]: 30: Hoare triple {30317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30317#false} is VALID [2022-04-28 03:45:11,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {30317#false} ~cond := #in~cond; {30317#false} is VALID [2022-04-28 03:45:11,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {30317#false} assume 0 == ~cond; {30317#false} is VALID [2022-04-28 03:45:11,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {30317#false} assume !false; {30317#false} is VALID [2022-04-28 03:45:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:11,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:12,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {30317#false} assume !false; {30317#false} is VALID [2022-04-28 03:45:12,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {30317#false} assume 0 == ~cond; {30317#false} is VALID [2022-04-28 03:45:12,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {30317#false} ~cond := #in~cond; {30317#false} is VALID [2022-04-28 03:45:12,345 INFO L272 TraceCheckUtils]: 30: Hoare triple {30317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30317#false} is VALID [2022-04-28 03:45:12,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {30423#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30317#false} is VALID [2022-04-28 03:45:12,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {30419#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30423#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:12,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {30415#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30419#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:45:12,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30415#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:45:12,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:12,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30408#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:12,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {30470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {30474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {30478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {30478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {30485#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~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; {30478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {30489#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~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; {30485#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:45:12,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {30493#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~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; {30489#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:12,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {30493#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30493#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:12,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {30500#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30493#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:12,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {30504#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {30500#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:45:12,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {30504#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:12,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {30470#(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; {30466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {30474#(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; {30470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {30478#(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; {30474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {30316#true} ~z~0 := ~y~0; {30478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:12,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {30316#true} [159] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {30316#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {30316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {30316#true} call #t~ret17 := main(); {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30316#true} {30316#true} #94#return; {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {30316#true} assume true; {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {30316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {30316#true} call ULTIMATE.init(); {30316#true} is VALID [2022-04-28 03:45:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:12,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762765873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:12,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:12,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 15] total 27 [2022-04-28 03:45:12,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:12,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957998988] [2022-04-28 03:45:12,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957998988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:12,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:12,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:45:12,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158940031] [2022-04-28 03:45:12,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:12,466 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 36 [2022-04-28 03:45:12,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:12,466 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 03:45:12,483 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 03:45:12,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:45:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:45:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:45:12,484 INFO L87 Difference]: Start difference. First operand 151 states and 202 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 03:45:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:14,427 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2022-04-28 03:45:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:45:14,427 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 36 [2022-04-28 03:45:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:14,428 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 03:45:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-28 03:45:14,428 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 03:45:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-28 03:45:14,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2022-04-28 03:45:14,498 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 03:45:14,499 INFO L225 Difference]: With dead ends: 200 [2022-04-28 03:45:14,500 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 03:45:14,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:45:14,500 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:14,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 46 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:45:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 03:45:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2022-04-28 03:45:15,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:15,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,199 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,199 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:15,201 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2022-04-28 03:45:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2022-04-28 03:45:15,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:15,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:15,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 03:45:15,201 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-28 03:45:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:15,203 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2022-04-28 03:45:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2022-04-28 03:45:15,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:15,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:15,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:15,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2022-04-28 03:45:15,205 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 36 [2022-04-28 03:45:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:15,205 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2022-04-28 03:45:15,205 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 03:45:15,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 187 transitions. [2022-04-28 03:45:24,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 184 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2022-04-28 03:45:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:45:24,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:24,641 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:24,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 03:45:24,843 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,SelfDestructingSolverStorable35 [2022-04-28 03:45:24,843 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1429571964, now seen corresponding path program 10 times [2022-04-28 03:45:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:24,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078824866] [2022-04-28 03:45:25,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:45:25,030 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1925007366, now seen corresponding path program 1 times [2022-04-28 03:45:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:25,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465354045] [2022-04-28 03:45:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:25,051 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:25,062 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:25,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {31622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31607#true} is VALID [2022-04-28 03:45:25,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {31607#true} assume true; {31607#true} is VALID [2022-04-28 03:45:25,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31607#true} {31607#true} #94#return; {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {31607#true} call ULTIMATE.init(); {31622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:25,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {31622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {31607#true} assume true; {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31607#true} {31607#true} #94#return; {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {31607#true} call #t~ret17 := main(); {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {31607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31607#true} is VALID [2022-04-28 03:45:25,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {31607#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31607#true} is VALID [2022-04-28 03:45:25,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {31607#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {31612#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:25,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {31612#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {31612#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:25,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {31612#(<= 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; {31613#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:25,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {31613#(<= 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; {31614#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {31614#(<= 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; {31615#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {31615#(<= 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; {31616#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {31616#(<= 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; {31617#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:25,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {31617#(<= 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; {31618#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {31618#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31619#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {31619#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:25,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {31620#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {31621#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:45:25,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {31621#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:25,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {31608#false} assume !(~z~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:25,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {31608#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31608#false} is VALID [2022-04-28 03:45:25,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {31608#false} assume !(~y~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:25,201 INFO L272 TraceCheckUtils]: 29: Hoare triple {31608#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31608#false} is VALID [2022-04-28 03:45:25,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {31608#false} ~cond := #in~cond; {31608#false} is VALID [2022-04-28 03:45:25,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {31608#false} assume 0 == ~cond; {31608#false} is VALID [2022-04-28 03:45:25,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {31608#false} assume !false; {31608#false} is VALID [2022-04-28 03:45:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:45:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465354045] [2022-04-28 03:45:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465354045] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517715501] [2022-04-28 03:45:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:25,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:25,202 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 03:45:25,203 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 03:45:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:25,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:45:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:25,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:25,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {31607#true} call ULTIMATE.init(); {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {31607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {31607#true} assume true; {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31607#true} {31607#true} #94#return; {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {31607#true} call #t~ret17 := main(); {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {31607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {31607#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {31607#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {31607#true} is VALID [2022-04-28 03:45:25,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {31607#true} ~z~0 := ~y~0; {31650#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:25,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {31650#(= 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; {31654#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:25,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {31654#(= 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; {31658#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:45:25,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {31658#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31662#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:25,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {31662#(= (+ (- 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; {31666#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:45:25,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {31666#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31670#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-28 03:45:25,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {31670#(= (+ (- 2) 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; {31674#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:25,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {31674#(= (+ main_~y~0 (- 5)) (+ 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; {31678#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:25,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {31678#(= (+ main_~y~0 (- 6)) (+ 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; {31682#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:45:25,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {31682#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !(~z~0 % 4294967296 > 0); {31682#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:45:25,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {31682#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31674#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:25,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {31674#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31666#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:45:25,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {31666#(= (+ (- 2) main_~y~0) (+ main_~z~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; {31658#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:45:25,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {31658#(= main_~y~0 (+ main_~z~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; {31698#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:45:25,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {31698#(and (= main_~z~0 main_~y~0) (< 0 (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; {31702#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:45:25,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {31702#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {31702#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:45:25,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {31702#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~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; {31709#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:45:25,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {31709#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~x~0 % 4294967296 > 0); {31709#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:45:25,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {31709#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~z~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:25,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {31608#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {31608#false} assume !(~y~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L272 TraceCheckUtils]: 29: Hoare triple {31608#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {31608#false} ~cond := #in~cond; {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {31608#false} assume 0 == ~cond; {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {31608#false} assume !false; {31608#false} is VALID [2022-04-28 03:45:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:45:25,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:26,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {31608#false} assume !false; {31608#false} is VALID [2022-04-28 03:45:26,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {31608#false} assume 0 == ~cond; {31608#false} is VALID [2022-04-28 03:45:26,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {31608#false} ~cond := #in~cond; {31608#false} is VALID [2022-04-28 03:45:26,143 INFO L272 TraceCheckUtils]: 29: Hoare triple {31608#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31608#false} is VALID [2022-04-28 03:45:26,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {31608#false} assume !(~y~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:26,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {31608#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31608#false} is VALID [2022-04-28 03:45:26,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {31752#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31608#false} is VALID [2022-04-28 03:45:26,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {31752#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {31752#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:45:26,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {31752#(< 0 (mod main_~z~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; {31752#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:45:26,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {31752#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31752#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:45:26,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {31765#(< 0 (mod (+ main_~z~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; {31752#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:45:26,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {31769#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (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; {31765#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:45:26,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {31773#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~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; {31769#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:45:26,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {31777#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~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; {31773#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:45:26,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {31781#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31777#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:45:26,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {31781#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {31781#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:26,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {31788#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31781#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:26,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {31792#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31788#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:45:26,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {31796#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~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; {31792#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:45:26,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {31800#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~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; {31796#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:45:26,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {31804#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31800#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:45:26,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {31808#(or (<= (mod (+ main_~y~0 4294967293) 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; {31804#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:45:26,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {31812#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31808#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:26,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {31816#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31812#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:26,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {31607#true} ~z~0 := ~y~0; {31816#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:26,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {31607#true} [161] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {31607#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {31607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {31607#true} call #t~ret17 := main(); {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31607#true} {31607#true} #94#return; {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {31607#true} assume true; {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {31607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {31607#true} call ULTIMATE.init(); {31607#true} is VALID [2022-04-28 03:45:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:26,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517715501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:26,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:26,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 39 [2022-04-28 03:45:26,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:26,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078824866] [2022-04-28 03:45:26,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078824866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:26,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:26,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:45:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242973485] [2022-04-28 03:45:26,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 36 [2022-04-28 03:45:26,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:26,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 03:45:26,496 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 03:45:26,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:45:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:26,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:45:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:45:26,498 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 03:45:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:32,812 INFO L93 Difference]: Finished difference Result 417 states and 601 transitions. [2022-04-28 03:45:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:45:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 36 [2022-04-28 03:45:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 03:45:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2022-04-28 03:45:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 03:45:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2022-04-28 03:45:32,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 194 transitions. [2022-04-28 03:45:33,065 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 03:45:33,071 INFO L225 Difference]: With dead ends: 417 [2022-04-28 03:45:33,071 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 03:45:33,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=3313, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:45:33,072 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 197 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:33,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 77 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:45:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 03:45:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 147. [2022-04-28 03:45:34,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:34,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 03:45:34,537 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 03:45:34,537 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 03:45:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:34,541 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2022-04-28 03:45:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 512 transitions. [2022-04-28 03:45:34,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:34,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:34,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 366 states. [2022-04-28 03:45:34,542 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 366 states. [2022-04-28 03:45:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:34,546 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2022-04-28 03:45:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 512 transitions. [2022-04-28 03:45:34,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:34,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:34,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:34,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 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 03:45:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 199 transitions. [2022-04-28 03:45:34,549 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 199 transitions. Word has length 36 [2022-04-28 03:45:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:34,549 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 199 transitions. [2022-04-28 03:45:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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 03:45:34,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 199 transitions. [2022-04-28 03:45:42,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 197 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 199 transitions. [2022-04-28 03:45:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:45:42,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:42,985 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:43,003 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 03:45:43,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:45:43,191 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 784665945, now seen corresponding path program 11 times [2022-04-28 03:45:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:43,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852751252] [2022-04-28 03:45:43,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:45:43,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1183802281, now seen corresponding path program 1 times [2022-04-28 03:45:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033809035] [2022-04-28 03:45:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:43,422 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:43,439 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:43,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {33758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33746#true} is VALID [2022-04-28 03:45:43,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {33746#true} assume true; {33746#true} is VALID [2022-04-28 03:45:43,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33746#true} {33746#true} #94#return; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {33746#true} call ULTIMATE.init(); {33758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {33758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {33746#true} assume true; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33746#true} {33746#true} #94#return; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {33746#true} call #t~ret17 := main(); {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {33746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {33746#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {33746#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {33746#true} ~z~0 := ~y~0; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {33746#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {33746#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {33746#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33746#true} is VALID [2022-04-28 03:45:43,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {33746#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33746#true} is VALID [2022-04-28 03:45:43,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {33746#true} assume !(~z~0 % 4294967296 > 0); {33746#true} is VALID [2022-04-28 03:45:43,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {33746#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33746#true} is VALID [2022-04-28 03:45:43,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {33746#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:43,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33752#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:43,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {33752#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33746#true} is VALID [2022-04-28 03:45:43,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {33746#true} assume !(~y~0 % 4294967296 > 0); {33753#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-28 03:45:43,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {33753#(<= (* (div (+ main_~y~0 4294967295) 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; {33754#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:45:43,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {33754#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) 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; {33755#(<= (+ 2 (* (div (+ main_~y~0 4294967293) 4294967296) 4294967296)) main_~y~0)} is VALID [2022-04-28 03:45:43,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {33755#(<= (+ 2 (* (div (+ main_~y~0 4294967293) 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; {33756#(<= (+ (* (div (+ 4294967292 main_~y~0) 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:45:43,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {33756#(<= (+ (* (div (+ 4294967292 main_~y~0) 4294967296) 4294967296) 3) 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; {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:45:43,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {33757#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {33747#false} is VALID [2022-04-28 03:45:43,558 INFO L272 TraceCheckUtils]: 30: Hoare triple {33747#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33747#false} is VALID [2022-04-28 03:45:43,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {33747#false} ~cond := #in~cond; {33747#false} is VALID [2022-04-28 03:45:43,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {33747#false} assume 0 == ~cond; {33747#false} is VALID [2022-04-28 03:45:43,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {33747#false} assume !false; {33747#false} is VALID [2022-04-28 03:45:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 03:45:43,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:43,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033809035] [2022-04-28 03:45:43,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033809035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:43,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584146300] [2022-04-28 03:45:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:43,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:43,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:43,580 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 03:45:43,581 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 03:45:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:43,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:45:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:43,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:43,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {33746#true} call ULTIMATE.init(); {33746#true} is VALID [2022-04-28 03:45:43,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {33746#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33746#true} is VALID [2022-04-28 03:45:43,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {33746#true} assume true; {33746#true} is VALID [2022-04-28 03:45:43,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33746#true} {33746#true} #94#return; {33746#true} is VALID [2022-04-28 03:45:43,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {33746#true} call #t~ret17 := main(); {33746#true} is VALID [2022-04-28 03:45:43,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {33746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33746#true} is VALID [2022-04-28 03:45:43,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {33746#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33746#true} is VALID [2022-04-28 03:45:43,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {33746#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33746#true} is VALID [2022-04-28 03:45:43,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {33746#true} ~z~0 := ~y~0; {33786#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:43,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {33786#(= 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; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {33790#(< 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; {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:43,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:43,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~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; {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 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; {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:43,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 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; {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:43,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33747#false} is VALID [2022-04-28 03:45:43,813 INFO L272 TraceCheckUtils]: 30: Hoare triple {33747#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33747#false} is VALID [2022-04-28 03:45:43,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {33747#false} ~cond := #in~cond; {33747#false} is VALID [2022-04-28 03:45:43,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {33747#false} assume 0 == ~cond; {33747#false} is VALID [2022-04-28 03:45:43,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {33747#false} assume !false; {33747#false} is VALID [2022-04-28 03:45:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:45:43,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:43,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {33747#false} assume !false; {33747#false} is VALID [2022-04-28 03:45:43,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {33747#false} assume 0 == ~cond; {33747#false} is VALID [2022-04-28 03:45:43,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {33747#false} ~cond := #in~cond; {33747#false} is VALID [2022-04-28 03:45:43,958 INFO L272 TraceCheckUtils]: 30: Hoare triple {33747#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33747#false} is VALID [2022-04-28 03:45:43,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33747#false} is VALID [2022-04-28 03:45:43,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 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; {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:43,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 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; {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:43,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~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; {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33817#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33813#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:43,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33809#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:43,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {33790#(< 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; {33751#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:43,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {33790#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {33938#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {33746#true} ~z~0 := ~y~0; {33938#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {33746#true} [163] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33746#true} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {33746#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33746#true} is VALID [2022-04-28 03:45:43,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {33746#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {33746#true} call #t~ret17 := main(); {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33746#true} {33746#true} #94#return; {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {33746#true} assume true; {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {33746#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {33746#true} call ULTIMATE.init(); {33746#true} is VALID [2022-04-28 03:45:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:45:43,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584146300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:43,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:43,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-28 03:45:44,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:44,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852751252] [2022-04-28 03:45:44,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852751252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:44,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:44,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:45:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899491792] [2022-04-28 03:45:44,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:44,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:44,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:44,122 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 03:45:44,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:45:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:45:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:45:44,122 INFO L87 Difference]: Start difference. First operand 147 states and 199 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:49,374 INFO L93 Difference]: Finished difference Result 356 states and 488 transitions. [2022-04-28 03:45:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:45:49,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 212 transitions. [2022-04-28 03:45:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 212 transitions. [2022-04-28 03:45:49,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 212 transitions. [2022-04-28 03:45:49,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:49,701 INFO L225 Difference]: With dead ends: 356 [2022-04-28 03:45:49,701 INFO L226 Difference]: Without dead ends: 351 [2022-04-28 03:45:49,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:45:49,702 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 170 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:49,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 63 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:45:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-28 03:45:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 179. [2022-04-28 03:45:50,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:50,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,728 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,728 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:50,733 INFO L93 Difference]: Finished difference Result 351 states and 472 transitions. [2022-04-28 03:45:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 472 transitions. [2022-04-28 03:45:50,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:50,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:50,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 03:45:50,733 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 351 states. [2022-04-28 03:45:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:50,754 INFO L93 Difference]: Finished difference Result 351 states and 472 transitions. [2022-04-28 03:45:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 472 transitions. [2022-04-28 03:45:50,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:50,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:50,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:50,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 242 transitions. [2022-04-28 03:45:50,757 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 242 transitions. Word has length 37 [2022-04-28 03:45:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:50,757 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 242 transitions. [2022-04-28 03:45:50,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 03:45:50,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 242 transitions. [2022-04-28 03:45:59,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 241 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 242 transitions. [2022-04-28 03:45:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:45:59,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:59,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:59,150 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 03:45:59,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:45:59,347 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1529476664, now seen corresponding path program 11 times [2022-04-28 03:45:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:59,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701596273] [2022-04-28 03:45:59,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:45:59,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2084189946, now seen corresponding path program 1 times [2022-04-28 03:45:59,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:59,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779265895] [2022-04-28 03:45:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:59,510 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:59,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:45:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:59,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {35863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35848#true} is VALID [2022-04-28 03:45:59,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {35848#true} assume true; {35848#true} is VALID [2022-04-28 03:45:59,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35848#true} {35848#true} #94#return; {35848#true} is VALID [2022-04-28 03:45:59,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {35848#true} call ULTIMATE.init(); {35863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:59,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {35863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {35848#true} assume true; {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35848#true} {35848#true} #94#return; {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {35848#true} call #t~ret17 := main(); {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {35848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {35848#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {35848#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {35848#true} is VALID [2022-04-28 03:45:59,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {35848#true} ~z~0 := ~y~0; {35848#true} is VALID [2022-04-28 03:45:59,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {35848#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35853#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:59,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {35853#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {35854#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:59,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {35854#(<= main_~z~0 (+ (* (div main_~z~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; {35855#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:59,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {35855#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {35856#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:59,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {35856#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {35857#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:59,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {35857#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35857#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:59,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {35857#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35858#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:45:59,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {35858#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35859#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:45:59,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {35859#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35860#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:59,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {35860#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35861#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:45:59,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {35861#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {35862#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {35849#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {35849#false} assume !(~y~0 % 4294967296 > 0); {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L272 TraceCheckUtils]: 30: Hoare triple {35849#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {35849#false} ~cond := #in~cond; {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {35849#false} assume 0 == ~cond; {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {35849#false} assume !false; {35849#false} is VALID [2022-04-28 03:45:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:45:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:59,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779265895] [2022-04-28 03:45:59,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779265895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:59,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159615811] [2022-04-28 03:45:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:59,660 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 03:45:59,660 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 03:45:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:59,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:45:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:59,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:59,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {35848#true} call ULTIMATE.init(); {35848#true} is VALID [2022-04-28 03:45:59,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {35848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35848#true} is VALID [2022-04-28 03:45:59,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {35848#true} assume true; {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35848#true} {35848#true} #94#return; {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {35848#true} call #t~ret17 := main(); {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {35848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {35848#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {35848#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {35848#true} is VALID [2022-04-28 03:45:59,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {35848#true} ~z~0 := ~y~0; {35891#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:59,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {35891#(= 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; {35895#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:59,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {35895#(= 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; {35899#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:45:59,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {35899#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35903#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:45:59,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {35903#(= 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; {35907#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:45:59,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {35907#(= main_~y~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; {35911#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:59,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {35911#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {35911#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:59,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {35911#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35903#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:45:59,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {35903#(= main_~y~0 (+ main_~z~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; {35895#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:59,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {35895#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35924#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:45:59,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {35924#(= main_~z~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; {35928#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:45:59,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {35928#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35932#(= (+ 5 main_~y~0) main_~z~0)} is VALID [2022-04-28 03:45:59,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {35932#(= (+ 5 main_~y~0) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {35932#(= (+ 5 main_~y~0) main_~z~0)} is VALID [2022-04-28 03:45:59,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {35932#(= (+ 5 main_~y~0) main_~z~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; {35939#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-28 03:45:59,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {35939#(= main_~z~0 (+ 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; {35928#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:45:59,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {35928#(= (+ main_~y~0 2) (+ (- 1) main_~z~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; {35946#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:45:59,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {35946#(= (+ (- 1) main_~z~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; {35924#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:45:59,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {35924#(= main_~z~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; {35891#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:59,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {35891#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {35891#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:59,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {35891#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {35959#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:59,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {35959#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {35849#false} assume !(~y~0 % 4294967296 > 0); {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L272 TraceCheckUtils]: 30: Hoare triple {35849#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {35849#false} ~cond := #in~cond; {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {35849#false} assume 0 == ~cond; {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {35849#false} assume !false; {35849#false} is VALID [2022-04-28 03:45:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:59,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:00,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {35849#false} assume !false; {35849#false} is VALID [2022-04-28 03:46:00,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {35849#false} assume 0 == ~cond; {35849#false} is VALID [2022-04-28 03:46:00,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {35849#false} ~cond := #in~cond; {35849#false} is VALID [2022-04-28 03:46:00,611 INFO L272 TraceCheckUtils]: 30: Hoare triple {35849#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35849#false} is VALID [2022-04-28 03:46:00,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {35849#false} assume !(~y~0 % 4294967296 > 0); {35849#false} is VALID [2022-04-28 03:46:00,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {35959#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35849#false} is VALID [2022-04-28 03:46:00,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35959#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:46:00,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:00,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {36003#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (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; {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:00,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {36007#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (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; {36003#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-28 03:46:00,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {36011#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~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; {36007#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-28 03:46:00,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {36015#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~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; {36011#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:00,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {36019#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~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; {36015#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:00,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {36019#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36019#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:46:00,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {36026#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ 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; {36019#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:46:00,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {36030#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~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; {36026#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4) 4294967296))))} is VALID [2022-04-28 03:46:00,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {36034#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~z~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; {36030#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-28 03:46:00,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {36038#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~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; {36034#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:46:00,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {36042#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36038#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:46:00,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {36042#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36042#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:00,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {36049#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36042#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:00,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {36053#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36049#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:46:00,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {36057#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36053#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:46:00,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {36061#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36057#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-28 03:46:00,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {36061#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:46:00,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {35848#true} ~z~0 := ~y~0; {35996#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:00,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {35848#true} [165] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {35848#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {35848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {35848#true} call #t~ret17 := main(); {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35848#true} {35848#true} #94#return; {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {35848#true} assume true; {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {35848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35848#true} is VALID [2022-04-28 03:46:00,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {35848#true} call ULTIMATE.init(); {35848#true} is VALID [2022-04-28 03:46:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:00,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159615811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:00,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:00,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 40 [2022-04-28 03:46:00,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:00,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701596273] [2022-04-28 03:46:00,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701596273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:00,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:00,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:46:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281273757] [2022-04-28 03:46:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 37 [2022-04-28 03:46:00,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:00,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 03:46:00,861 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 03:46:00,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:46:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:46:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1681, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:46:00,861 INFO L87 Difference]: Start difference. First operand 179 states and 242 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 03:46:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:05,648 INFO L93 Difference]: Finished difference Result 319 states and 439 transitions. [2022-04-28 03:46:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:46:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 37 [2022-04-28 03:46:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 03:46:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2022-04-28 03:46:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 03:46:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2022-04-28 03:46:05,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 109 transitions. [2022-04-28 03:46:05,819 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 03:46:05,823 INFO L225 Difference]: With dead ends: 319 [2022-04-28 03:46:05,823 INFO L226 Difference]: Without dead ends: 302 [2022-04-28 03:46:05,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=782, Invalid=4768, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:46:05,826 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:05,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 68 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:46:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-28 03:46:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 216. [2022-04-28 03:46:07,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:07,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:07,604 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:07,604 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:07,608 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2022-04-28 03:46:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2022-04-28 03:46:07,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:07,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:07,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 302 states. [2022-04-28 03:46:07,608 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 302 states. [2022-04-28 03:46:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:07,612 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2022-04-28 03:46:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2022-04-28 03:46:07,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:07,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:07,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:07,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 293 transitions. [2022-04-28 03:46:07,615 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 293 transitions. Word has length 37 [2022-04-28 03:46:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:07,616 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 293 transitions. [2022-04-28 03:46:07,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 03:46:07,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 293 transitions. [2022-04-28 03:46:20,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 290 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-28 03:46:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:46:20,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:20,828 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:20,843 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 03:46:21,028 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,SelfDestructingSolverStorable38 [2022-04-28 03:46:21,028 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1410664363, now seen corresponding path program 8 times [2022-04-28 03:46:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:21,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618695106] [2022-04-28 03:46:25,126 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:46:25,209 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:46:25,211 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -550176617, now seen corresponding path program 1 times [2022-04-28 03:46:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530571957] [2022-04-28 03:46:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:25,222 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:25,240 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:25,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {37847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37835#true} is VALID [2022-04-28 03:46:25,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {37835#true} assume true; {37835#true} is VALID [2022-04-28 03:46:25,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37835#true} {37835#true} #94#return; {37835#true} is VALID [2022-04-28 03:46:25,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {37835#true} call ULTIMATE.init(); {37847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:25,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {37847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37835#true} is VALID [2022-04-28 03:46:25,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {37835#true} assume true; {37835#true} is VALID [2022-04-28 03:46:25,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37835#true} {37835#true} #94#return; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {37835#true} call #t~ret17 := main(); {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {37835#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {37835#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {37835#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {37835#true} ~z~0 := ~y~0; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {37835#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {37835#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {37835#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {37835#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {37835#true} assume !(~z~0 % 4294967296 > 0); {37835#true} is VALID [2022-04-28 03:46:25,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {37835#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37835#true} is VALID [2022-04-28 03:46:25,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {37835#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:46:25,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37841#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:46:25,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {37841#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37842#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-28 03:46:25,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {37842#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {37842#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-28 03:46:25,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {37842#(<= (* (div (+ main_~y~0 3) 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; {37843#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:25,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {37843#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 1) 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; {37844#(<= (+ 2 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) main_~y~0)} is VALID [2022-04-28 03:46:25,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {37844#(<= (+ 2 (* (div (+ main_~y~0 1) 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; {37845#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:25,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {37845#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) 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; {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:46:25,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {37846#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37845#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:46:25,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {37845#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {37836#false} is VALID [2022-04-28 03:46:25,335 INFO L272 TraceCheckUtils]: 31: Hoare triple {37836#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37836#false} is VALID [2022-04-28 03:46:25,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {37836#false} ~cond := #in~cond; {37836#false} is VALID [2022-04-28 03:46:25,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {37836#false} assume 0 == ~cond; {37836#false} is VALID [2022-04-28 03:46:25,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {37836#false} assume !false; {37836#false} is VALID [2022-04-28 03:46:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 03:46:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530571957] [2022-04-28 03:46:25,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530571957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578622469] [2022-04-28 03:46:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:25,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:25,337 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 03:46:25,358 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 03:46:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:25,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:46:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:25,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:25,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {37835#true} call ULTIMATE.init(); {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {37835#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {37835#true} assume true; {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37835#true} {37835#true} #94#return; {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {37835#true} call #t~ret17 := main(); {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {37835#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {37835#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37835#true} is VALID [2022-04-28 03:46:25,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {37835#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37835#true} is VALID [2022-04-28 03:46:25,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {37835#true} ~z~0 := ~y~0; {37875#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:25,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {37875#(= 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; {37879#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:25,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {37879#(= 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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {37883#(< 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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {37883#(< 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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {37883#(< 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; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {37896#(< 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; {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:46:25,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:46:25,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:25,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:25,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 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; {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:46:25,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 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; {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:46:25,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {37896#(< 0 (mod main_~y~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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {37896#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37836#false} is VALID [2022-04-28 03:46:25,596 INFO L272 TraceCheckUtils]: 31: Hoare triple {37836#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37836#false} is VALID [2022-04-28 03:46:25,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {37836#false} ~cond := #in~cond; {37836#false} is VALID [2022-04-28 03:46:25,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {37836#false} assume 0 == ~cond; {37836#false} is VALID [2022-04-28 03:46:25,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {37836#false} assume !false; {37836#false} is VALID [2022-04-28 03:46:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 03:46:25,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:25,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {37836#false} assume !false; {37836#false} is VALID [2022-04-28 03:46:25,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {37836#false} assume 0 == ~cond; {37836#false} is VALID [2022-04-28 03:46:25,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {37836#false} ~cond := #in~cond; {37836#false} is VALID [2022-04-28 03:46:25,755 INFO L272 TraceCheckUtils]: 31: Hoare triple {37836#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37836#false} is VALID [2022-04-28 03:46:25,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {37896#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37836#false} is VALID [2022-04-28 03:46:25,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {37896#(< 0 (mod main_~y~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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 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; {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:46:25,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 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; {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:46:25,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:25,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37907#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:25,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37903#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:46:25,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {37896#(< 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; {37840#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:46:25,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {37883#(< 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; {37896#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:25,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {37883#(< 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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {37883#(< 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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {38031#(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; {37883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:25,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {38035#(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; {38031#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:46:25,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {37835#true} ~z~0 := ~y~0; {38035#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:25,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {37835#true} [167] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {37835#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {37835#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {37835#true} call #t~ret17 := main(); {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37835#true} {37835#true} #94#return; {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {37835#true} assume true; {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {37835#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {37835#true} call ULTIMATE.init(); {37835#true} is VALID [2022-04-28 03:46:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 03:46:25,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578622469] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:25,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:25,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 03:46:25,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:25,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618695106] [2022-04-28 03:46:25,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618695106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:25,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:25,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:46:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075843374] [2022-04-28 03:46:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have 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 03:46:25,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:25,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:25,953 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 03:46:25,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:46:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:46:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:46:25,953 INFO L87 Difference]: Start difference. First operand 216 states and 293 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:32,059 INFO L93 Difference]: Finished difference Result 388 states and 499 transitions. [2022-04-28 03:46:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:46:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have 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 03:46:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-28 03:46:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-28 03:46:32,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 158 transitions. [2022-04-28 03:46:32,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:32,328 INFO L225 Difference]: With dead ends: 388 [2022-04-28 03:46:32,328 INFO L226 Difference]: Without dead ends: 383 [2022-04-28 03:46:32,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=580, Invalid=2612, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:46:32,328 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:32,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 63 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:46:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-28 03:46:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 229. [2022-04-28 03:46:34,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:34,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:34,355 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:34,355 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:34,360 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-28 03:46:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-28 03:46:34,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:34,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:34,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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 03:46:34,361 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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 03:46:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:34,365 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-28 03:46:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-28 03:46:34,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:34,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:34,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:34,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 307 transitions. [2022-04-28 03:46:34,369 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 307 transitions. Word has length 38 [2022-04-28 03:46:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:34,369 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 307 transitions. [2022-04-28 03:46:34,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:34,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 307 transitions. [2022-04-28 03:46:48,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 305 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 307 transitions. [2022-04-28 03:46:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:46:48,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:48,123 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:48,139 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 03:46:48,323 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,SelfDestructingSolverStorable39 [2022-04-28 03:46:48,324 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash 899157845, now seen corresponding path program 12 times [2022-04-28 03:46:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760031732] [2022-04-28 03:46:50,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:46:50,505 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1658591401, now seen corresponding path program 1 times [2022-04-28 03:46:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:50,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386248639] [2022-04-28 03:46:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:50,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:50,541 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:50,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {40172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40155#true} is VALID [2022-04-28 03:46:50,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {40155#true} assume true; {40155#true} is VALID [2022-04-28 03:46:50,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40155#true} {40155#true} #94#return; {40155#true} is VALID [2022-04-28 03:46:50,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {40155#true} call ULTIMATE.init(); {40172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:50,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {40172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {40155#true} assume true; {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40155#true} {40155#true} #94#return; {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {40155#true} call #t~ret17 := main(); {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {40155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {40155#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {40155#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {40155#true} is VALID [2022-04-28 03:46:50,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {40155#true} ~z~0 := ~y~0; {40160#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:46:50,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {40160#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40161#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:50,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {40161#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40162#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:50,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {40162#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40163#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:50,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {40163#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40164#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:50,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {40164#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40165#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:46:50,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {40165#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {40166#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:50,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {40166#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40167#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {40167#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40168#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {40168#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40169#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {40169#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40170#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:50,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {40170#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40171#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {40171#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {40156#false} assume !(~y~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {40156#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; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {40156#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; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {40156#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; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {40156#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; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {40156#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; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {40156#false} assume !(~x~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {40156#false} assume !(~z~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {40156#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {40156#false} assume !(~y~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:50,752 INFO L272 TraceCheckUtils]: 31: Hoare triple {40156#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40156#false} is VALID [2022-04-28 03:46:50,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {40156#false} ~cond := #in~cond; {40156#false} is VALID [2022-04-28 03:46:50,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {40156#false} assume 0 == ~cond; {40156#false} is VALID [2022-04-28 03:46:50,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {40156#false} assume !false; {40156#false} is VALID [2022-04-28 03:46:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:46:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386248639] [2022-04-28 03:46:50,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386248639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818725861] [2022-04-28 03:46:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:50,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:50,754 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 03:46:50,755 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 03:46:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:46:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:50,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:51,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {40155#true} call ULTIMATE.init(); {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {40155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {40155#true} assume true; {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40155#true} {40155#true} #94#return; {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {40155#true} call #t~ret17 := main(); {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {40155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {40155#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {40155#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {40155#true} is VALID [2022-04-28 03:46:51,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {40155#true} ~z~0 := ~y~0; {40160#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {40160#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40161#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {40161#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {40155#true} assume !(~z~0 % 4294967296 > 0); {40155#true} is VALID [2022-04-28 03:46:51,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40155#true} is VALID [2022-04-28 03:46:51,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40155#true} is VALID [2022-04-28 03:46:51,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:46:51,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {40227#(< 0 (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; {40231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:46:51,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {40231#(< 0 (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; {40235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:46:51,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {40235#(< 0 (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; {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:46:51,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:46:51,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {40239#(< 0 (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; {40235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:46:51,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {40235#(< 0 (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; {40231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:46:51,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {40231#(< 0 (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; {40227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:46:51,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {40227#(< 0 (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; {40255#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:51,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {40255#(< 0 (mod main_~y~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; {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40255#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:51,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {40255#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:51,037 INFO L272 TraceCheckUtils]: 31: Hoare triple {40156#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40156#false} is VALID [2022-04-28 03:46:51,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {40156#false} ~cond := #in~cond; {40156#false} is VALID [2022-04-28 03:46:51,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {40156#false} assume 0 == ~cond; {40156#false} is VALID [2022-04-28 03:46:51,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {40156#false} assume !false; {40156#false} is VALID [2022-04-28 03:46:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:46:51,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:51,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {40156#false} assume !false; {40156#false} is VALID [2022-04-28 03:46:51,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {40156#false} assume 0 == ~cond; {40156#false} is VALID [2022-04-28 03:46:51,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {40156#false} ~cond := #in~cond; {40156#false} is VALID [2022-04-28 03:46:51,131 INFO L272 TraceCheckUtils]: 31: Hoare triple {40156#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40156#false} is VALID [2022-04-28 03:46:51,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {40255#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40156#false} is VALID [2022-04-28 03:46:51,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40255#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:51,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {40255#(< 0 (mod main_~y~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; {40259#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:46:51,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {40227#(< 0 (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; {40255#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:46:51,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {40231#(< 0 (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; {40227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:46:51,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {40235#(< 0 (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; {40231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:46:51,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {40239#(< 0 (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; {40235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:46:51,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:46:51,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {40235#(< 0 (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; {40239#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:46:51,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {40231#(< 0 (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; {40235#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:46:51,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {40227#(< 0 (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; {40231#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40227#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {40155#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {40155#true} assume !(~z~0 % 4294967296 > 0); {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {40155#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {40155#true} ~z~0 := ~y~0; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {40155#true} [169] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {40155#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {40155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {40155#true} call #t~ret17 := main(); {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40155#true} {40155#true} #94#return; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {40155#true} assume true; {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {40155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {40155#true} call ULTIMATE.init(); {40155#true} is VALID [2022-04-28 03:46:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 03:46:51,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818725861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:51,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:51,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 21 [2022-04-28 03:46:51,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:51,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760031732] [2022-04-28 03:46:51,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760031732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:51,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:51,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:46:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834457571] [2022-04-28 03:46:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 38 [2022-04-28 03:46:51,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:51,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:46:51,347 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 03:46:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:46:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:46:51,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:46:51,348 INFO L87 Difference]: Start difference. First operand 229 states and 307 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:46:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:57,865 INFO L93 Difference]: Finished difference Result 523 states and 691 transitions. [2022-04-28 03:46:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:46:57,865 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 38 [2022-04-28 03:46:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:46:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 165 transitions. [2022-04-28 03:46:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:46:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 165 transitions. [2022-04-28 03:46:57,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 165 transitions. [2022-04-28 03:46:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:58,069 INFO L225 Difference]: With dead ends: 523 [2022-04-28 03:46:58,069 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 03:46:58,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=705, Invalid=4125, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:46:58,070 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 113 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:58,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 86 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:46:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 03:46:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 234. [2022-04-28 03:46:59,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:59,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:59,842 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:59,842 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:59,846 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2022-04-28 03:46:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2022-04-28 03:46:59,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:59,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:59,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-28 03:46:59,846 INFO L87 Difference]: Start difference. First operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-28 03:46:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:59,850 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2022-04-28 03:46:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2022-04-28 03:46:59,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:59,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:59,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:59,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 310 transitions. [2022-04-28 03:46:59,853 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 310 transitions. Word has length 38 [2022-04-28 03:46:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:59,854 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 310 transitions. [2022-04-28 03:46:59,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:46:59,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 310 transitions. [2022-04-28 03:47:16,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 306 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:16,646 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 310 transitions. [2022-04-28 03:47:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:47:16,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:16,646 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:16,663 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 03:47:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:16,847 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -164755688, now seen corresponding path program 13 times [2022-04-28 03:47:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:16,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896276309] [2022-04-28 03:47:17,031 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:17,032 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -145357033, now seen corresponding path program 1 times [2022-04-28 03:47:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:17,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656305544] [2022-04-28 03:47:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:17,045 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:17,058 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:17,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {42657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42641#true} is VALID [2022-04-28 03:47:17,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {42641#true} assume true; {42641#true} is VALID [2022-04-28 03:47:17,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42641#true} {42641#true} #94#return; {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {42641#true} call ULTIMATE.init(); {42657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:17,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {42657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {42641#true} assume true; {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42641#true} {42641#true} #94#return; {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {42641#true} call #t~ret17 := main(); {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {42641#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42641#true} is VALID [2022-04-28 03:47:17,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {42641#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42641#true} is VALID [2022-04-28 03:47:17,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {42641#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {42646#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:17,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {42646#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42646#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:17,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {42646#(<= 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; {42647#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:47:17,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {42647#(<= 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; {42648#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {42648#(<= 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; {42649#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {42649#(<= 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; {42650#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {42650#(<= 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; {42651#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:47:17,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {42651#(<= 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; {42652#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {42652#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42653#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {42653#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42654#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:17,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {42654#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~y~0 % 4294967296 > 0); {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:17,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {42655#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42656#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:47:17,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {42656#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {42642#false} is VALID [2022-04-28 03:47:17,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {42642#false} assume !(~z~0 % 4294967296 > 0); {42642#false} is VALID [2022-04-28 03:47:17,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {42642#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42642#false} is VALID [2022-04-28 03:47:17,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {42642#false} assume !(~y~0 % 4294967296 > 0); {42642#false} is VALID [2022-04-28 03:47:17,229 INFO L272 TraceCheckUtils]: 31: Hoare triple {42642#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42642#false} is VALID [2022-04-28 03:47:17,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {42642#false} ~cond := #in~cond; {42642#false} is VALID [2022-04-28 03:47:17,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {42642#false} assume 0 == ~cond; {42642#false} is VALID [2022-04-28 03:47:17,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {42642#false} assume !false; {42642#false} is VALID [2022-04-28 03:47:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:47:17,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:17,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656305544] [2022-04-28 03:47:17,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656305544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:17,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142932868] [2022-04-28 03:47:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:17,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:17,231 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 03:47:17,232 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 03:47:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:17,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:47:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:17,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:17,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {42641#true} call ULTIMATE.init(); {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {42641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {42641#true} assume true; {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42641#true} {42641#true} #94#return; {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {42641#true} call #t~ret17 := main(); {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {42641#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {42641#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42641#true} is VALID [2022-04-28 03:47:17,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {42641#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {42641#true} is VALID [2022-04-28 03:47:17,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {42641#true} ~z~0 := ~y~0; {42685#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:17,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {42685#(= 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; {42689#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:17,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {42689#(= 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; {42693#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:47:17,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {42693#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42697#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:47:17,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {42697#(= 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; {42701#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:17,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {42701#(= (+ main_~y~0 (- 3)) (+ 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; {42705#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-28 03:47:17,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {42705#(= (+ 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; {42709#(= (+ main_~y~0 (- 3)) (+ main_~z~0 3))} is VALID [2022-04-28 03:47:17,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {42709#(= (+ main_~y~0 (- 3)) (+ 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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {42713#(< 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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {42713#(< 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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {42713#(< 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; {42726#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {42726#(< 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; {42730#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:17,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {42730#(< 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; {42734#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:17,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {42734#(< 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; {42738#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:17,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {42738#(< 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; {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:17,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {42742#(< 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; {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:17,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {42746#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:17,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {42746#(< 0 (mod main_~y~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; {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:17,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:17,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:17,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:17,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {42746#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42642#false} is VALID [2022-04-28 03:47:17,641 INFO L272 TraceCheckUtils]: 31: Hoare triple {42642#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42642#false} is VALID [2022-04-28 03:47:17,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {42642#false} ~cond := #in~cond; {42642#false} is VALID [2022-04-28 03:47:17,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {42642#false} assume 0 == ~cond; {42642#false} is VALID [2022-04-28 03:47:17,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {42642#false} assume !false; {42642#false} is VALID [2022-04-28 03:47:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:47:17,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:18,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {42642#false} assume !false; {42642#false} is VALID [2022-04-28 03:47:18,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {42642#false} assume 0 == ~cond; {42642#false} is VALID [2022-04-28 03:47:18,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {42642#false} ~cond := #in~cond; {42642#false} is VALID [2022-04-28 03:47:18,052 INFO L272 TraceCheckUtils]: 31: Hoare triple {42642#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42642#false} is VALID [2022-04-28 03:47:18,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {42746#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42642#false} is VALID [2022-04-28 03:47:18,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:18,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:18,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:18,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {42746#(< 0 (mod main_~y~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; {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:18,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {42746#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:18,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {42742#(< 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; {42746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:18,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {42738#(< 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; {42742#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:18,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {42734#(< 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; {42738#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:18,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {42730#(< 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; {42734#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:18,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {42726#(< 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; {42730#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {42713#(< 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; {42726#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {42713#(< 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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {42713#(< 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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {42834#(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; {42713#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:18,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {42838#(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; {42834#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:18,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {42842#(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; {42838#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:18,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {42846#(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; {42842#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:18,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {42850#(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; {42846#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:18,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {42854#(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; {42850#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:18,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {42858#(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; {42854#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {42641#true} ~z~0 := ~y~0; {42858#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {42641#true} [171] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {42641#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {42641#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {42641#true} call #t~ret17 := main(); {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42641#true} {42641#true} #94#return; {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {42641#true} assume true; {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {42641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42641#true} is VALID [2022-04-28 03:47:18,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {42641#true} call ULTIMATE.init(); {42641#true} is VALID [2022-04-28 03:47:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:47:18,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142932868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:18,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:18,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 35 [2022-04-28 03:47:18,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:18,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896276309] [2022-04-28 03:47:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896276309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:18,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:18,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:47:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895614591] [2022-04-28 03:47:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 39 [2022-04-28 03:47:18,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:18,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:47:18,547 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 03:47:18,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:47:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:47:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:47:18,548 INFO L87 Difference]: Start difference. First operand 234 states and 310 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:47:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:28,497 INFO L93 Difference]: Finished difference Result 710 states and 1011 transitions. [2022-04-28 03:47:28,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:47:28,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 39 [2022-04-28 03:47:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:47:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 223 transitions. [2022-04-28 03:47:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:47:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 223 transitions. [2022-04-28 03:47:28,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 223 transitions. [2022-04-28 03:47:28,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:28,920 INFO L225 Difference]: With dead ends: 710 [2022-04-28 03:47:28,920 INFO L226 Difference]: Without dead ends: 633 [2022-04-28 03:47:28,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=3244, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:47:28,923 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 211 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:28,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 88 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:47:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-04-28 03:47:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 246. [2022-04-28 03:47:30,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:30,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 03:47:30,673 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 03:47:30,674 INFO L87 Difference]: Start difference. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 03:47:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:30,685 INFO L93 Difference]: Finished difference Result 633 states and 874 transitions. [2022-04-28 03:47:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 874 transitions. [2022-04-28 03:47:30,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:30,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:30,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 633 states. [2022-04-28 03:47:30,686 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 633 states. [2022-04-28 03:47:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:30,698 INFO L93 Difference]: Finished difference Result 633 states and 874 transitions. [2022-04-28 03:47:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 874 transitions. [2022-04-28 03:47:30,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:30,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:30,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:30,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 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 03:47:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2022-04-28 03:47:30,702 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 39 [2022-04-28 03:47:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2022-04-28 03:47:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 03:47:30,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 327 transitions. [2022-04-28 03:47:51,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 323 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-28 03:47:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:47:51,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:51,533 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:51,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:51,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:51,734 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 106842550, now seen corresponding path program 14 times [2022-04-28 03:47:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823261295] [2022-04-28 03:47:51,907 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:51,908 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2117036503, now seen corresponding path program 1 times [2022-04-28 03:47:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:51,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380686977] [2022-04-28 03:47:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:51,920 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:51,933 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:52,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {46130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {46113#true} assume true; {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46113#true} {46113#true} #94#return; {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {46113#true} call ULTIMATE.init(); {46130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:52,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {46130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {46113#true} assume true; {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46113#true} {46113#true} #94#return; {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {46113#true} call #t~ret17 := main(); {46113#true} is VALID [2022-04-28 03:47:52,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {46113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46113#true} is VALID [2022-04-28 03:47:52,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {46113#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46113#true} is VALID [2022-04-28 03:47:52,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {46113#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {46118#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:52,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {46118#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {46118#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:52,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {46118#(<= 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; {46119#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:47:52,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {46119#(<= 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; {46120#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {46120#(<= 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; {46121#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {46121#(<= 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; {46122#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {46122#(<= 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; {46123#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:47:52,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {46123#(<= 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; {46124#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {46124#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46125#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {46125#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46126#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:52,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {46126#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46127#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:52,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {46127#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~y~0 % 4294967296 > 0); {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:47:52,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {46128#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46129#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:47:52,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {46129#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {46114#false} assume !(~z~0 % 4294967296 > 0); {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {46114#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {46114#false} assume !(~y~0 % 4294967296 > 0); {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L272 TraceCheckUtils]: 32: Hoare triple {46114#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {46114#false} ~cond := #in~cond; {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {46114#false} assume 0 == ~cond; {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {46114#false} assume !false; {46114#false} is VALID [2022-04-28 03:47:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:47:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:52,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380686977] [2022-04-28 03:47:52,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380686977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:52,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301876793] [2022-04-28 03:47:52,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:52,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:52,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:52,116 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 03:47:52,117 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 03:47:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:52,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:47:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:52,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:52,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {46113#true} call ULTIMATE.init(); {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {46113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {46113#true} assume true; {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46113#true} {46113#true} #94#return; {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {46113#true} call #t~ret17 := main(); {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {46113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {46113#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46113#true} is VALID [2022-04-28 03:47:52,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {46113#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {46113#true} is VALID [2022-04-28 03:47:52,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {46113#true} ~z~0 := ~y~0; {46158#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:52,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {46158#(= 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; {46162#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:52,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {46162#(= 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; {46166#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:47:52,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {46166#(= (+ 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; {46170#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:47:52,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {46170#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46174#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:52,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {46174#(= (+ main_~y~0 (- 3)) (+ 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; {46178#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:52,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {46178#(= (+ main_~y~0 (- 4)) (+ 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; {46182#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-28 03:47:52,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {46182#(= (+ main_~y~0 (- 4)) (+ 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {46186#(< 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; {46202#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {46202#(< 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; {46206#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {46206#(< 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; {46210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:52,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {46210#(< 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; {46214#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:52,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {46214#(< 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; {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#(< 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; {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {46222#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {46222#(< 0 (mod main_~y~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; {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {46222#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46114#false} is VALID [2022-04-28 03:47:52,573 INFO L272 TraceCheckUtils]: 32: Hoare triple {46114#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46114#false} is VALID [2022-04-28 03:47:52,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {46114#false} ~cond := #in~cond; {46114#false} is VALID [2022-04-28 03:47:52,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {46114#false} assume 0 == ~cond; {46114#false} is VALID [2022-04-28 03:47:52,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {46114#false} assume !false; {46114#false} is VALID [2022-04-28 03:47:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:47:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:52,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {46114#false} assume !false; {46114#false} is VALID [2022-04-28 03:47:52,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {46114#false} assume 0 == ~cond; {46114#false} is VALID [2022-04-28 03:47:52,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {46114#false} ~cond := #in~cond; {46114#false} is VALID [2022-04-28 03:47:52,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {46114#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46114#false} is VALID [2022-04-28 03:47:52,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {46222#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46114#false} is VALID [2022-04-28 03:47:52,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {46222#(< 0 (mod main_~y~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; {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {46222#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#(< 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; {46222#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:52,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {46214#(< 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; {46218#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:52,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {46210#(< 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; {46214#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:52,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {46206#(< 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; {46210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:52,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {46202#(< 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; {46206#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {46186#(< 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; {46202#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {46186#(< 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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {46313#(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; {46186#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:52,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {46317#(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; {46313#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:52,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {46321#(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; {46317#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:52,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {46325#(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; {46321#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:52,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {46329#(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; {46325#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:52,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {46333#(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; {46329#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:52,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {46337#(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; {46333#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:47:52,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {46113#true} ~z~0 := ~y~0; {46337#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:47:52,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {46113#true} [173] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {46113#true} is VALID [2022-04-28 03:47:52,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {46113#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46113#true} is VALID [2022-04-28 03:47:52,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {46113#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46113#true} is VALID [2022-04-28 03:47:52,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {46113#true} call #t~ret17 := main(); {46113#true} is VALID [2022-04-28 03:47:52,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46113#true} {46113#true} #94#return; {46113#true} is VALID [2022-04-28 03:47:52,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {46113#true} assume true; {46113#true} is VALID [2022-04-28 03:47:52,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {46113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46113#true} is VALID [2022-04-28 03:47:52,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {46113#true} call ULTIMATE.init(); {46113#true} is VALID [2022-04-28 03:47:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:47:52,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301876793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:52,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:52,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 36 [2022-04-28 03:47:53,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823261295] [2022-04-28 03:47:53,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823261295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:53,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:53,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:47:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068775639] [2022-04-28 03:47:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) 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 40 [2022-04-28 03:47:53,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:53,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.55) 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 03:47:53,457 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 03:47:53,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:47:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:47:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:47:53,458 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand has 20 states, 20 states have (on average 1.55) 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 03:48:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:05,509 INFO L93 Difference]: Finished difference Result 739 states and 1052 transitions. [2022-04-28 03:48:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:48:05,509 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) 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 40 [2022-04-28 03:48:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) 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 03:48:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 233 transitions. [2022-04-28 03:48:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) 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 03:48:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 233 transitions. [2022-04-28 03:48:05,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 233 transitions. [2022-04-28 03:48:05,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:05,937 INFO L225 Difference]: With dead ends: 739 [2022-04-28 03:48:05,938 INFO L226 Difference]: Without dead ends: 662 [2022-04-28 03:48:05,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=437, Invalid=3469, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:48:05,939 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 222 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:05,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 104 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:48:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-28 03:48:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 257. [2022-04-28 03:48:08,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:08,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 03:48:08,369 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 03:48:08,369 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 03:48:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:08,383 INFO L93 Difference]: Finished difference Result 662 states and 915 transitions. [2022-04-28 03:48:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 915 transitions. [2022-04-28 03:48:08,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:08,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:08,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 662 states. [2022-04-28 03:48:08,384 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 662 states. [2022-04-28 03:48:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:08,399 INFO L93 Difference]: Finished difference Result 662 states and 915 transitions. [2022-04-28 03:48:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 915 transitions. [2022-04-28 03:48:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:08,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:08,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 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 03:48:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 342 transitions. [2022-04-28 03:48:08,403 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 342 transitions. Word has length 40 [2022-04-28 03:48:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:08,403 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 342 transitions. [2022-04-28 03:48:08,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) 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 03:48:08,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 342 transitions. [2022-04-28 03:48:27,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 338 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-28 03:48:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:48:27,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:27,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:27,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:27,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:27,907 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 9 times [2022-04-28 03:48:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:27,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690494135] [2022-04-28 03:48:30,054 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:30,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:30,142 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1212011049, now seen corresponding path program 1 times [2022-04-28 03:48:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:30,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503923615] [2022-04-28 03:48:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:30,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:30,162 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,181 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {49744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49732#true} is VALID [2022-04-28 03:48:30,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {49732#true} assume true; {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49732#true} {49732#true} #94#return; {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {49732#true} call ULTIMATE.init(); {49744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:30,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {49744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {49732#true} assume true; {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49732#true} {49732#true} #94#return; {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {49732#true} call #t~ret17 := main(); {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {49732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49732#true} is VALID [2022-04-28 03:48:30,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {49732#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49732#true} is VALID [2022-04-28 03:48:30,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {49732#true} [175] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {49737#(<= 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; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {49738#(<= 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; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {49739#(<= 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; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {49740#(<= 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; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {49741#(<= 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; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {49741#(<= 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; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {49741#(<= 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; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {49741#(<= 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; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {49741#(<= 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; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {49740#(<= 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; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {49739#(<= 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; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {49738#(<= 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; {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,341 INFO L272 TraceCheckUtils]: 34: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:48:30,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {49742#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {49743#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:48:30,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {49743#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {49733#false} is VALID [2022-04-28 03:48:30,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {49733#false} assume !false; {49733#false} is VALID [2022-04-28 03:48:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:48:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503923615] [2022-04-28 03:48:30,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503923615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983320336] [2022-04-28 03:48:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:30,343 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 03:48:30,364 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 03:48:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:48:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:30,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {49732#true} call ULTIMATE.init(); {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {49732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {49732#true} assume true; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49732#true} {49732#true} #94#return; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {49732#true} call #t~ret17 := main(); {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {49732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {49732#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {49732#true} [175] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {49732#true} ~z~0 := ~y~0; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {49732#true} assume !(~z~0 % 4294967296 > 0); {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {49732#true} assume !(~y~0 % 4294967296 > 0); {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {49732#true} assume !(~x~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,671 INFO L272 TraceCheckUtils]: 34: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:30,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {49850#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:30,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {49854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49733#false} is VALID [2022-04-28 03:48:30,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {49733#false} assume !false; {49733#false} is VALID [2022-04-28 03:48:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:48:30,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:30,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {49733#false} assume !false; {49733#false} is VALID [2022-04-28 03:48:30,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {49854#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49733#false} is VALID [2022-04-28 03:48:30,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {49850#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49854#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:30,896 INFO L272 TraceCheckUtils]: 34: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49850#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:30,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49741#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:30,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:30,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {49732#true} assume !(~x~0 % 4294967296 > 0); {49737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:30,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {49732#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {49732#true} assume !(~y~0 % 4294967296 > 0); {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {49732#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {49732#true} assume !(~z~0 % 4294967296 > 0); {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {49732#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49732#true} is VALID [2022-04-28 03:48:30,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {49732#true} ~z~0 := ~y~0; {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {49732#true} [175] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {49732#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {49732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {49732#true} call #t~ret17 := main(); {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49732#true} {49732#true} #94#return; {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {49732#true} assume true; {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {49732#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {49732#true} call ULTIMATE.init(); {49732#true} is VALID [2022-04-28 03:48:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:48:30,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983320336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:30,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:30,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-28 03:48:31,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:31,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690494135] [2022-04-28 03:48:31,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690494135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:31,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:31,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:48:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560355] [2022-04-28 03:48:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 41 [2022-04-28 03:48:31,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:31,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 03:48:31,065 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 03:48:31,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:48:31,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:31,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:48:31,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:48:31,066 INFO L87 Difference]: Start difference. First operand 257 states and 342 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 03:48:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:36,714 INFO L93 Difference]: Finished difference Result 418 states and 556 transitions. [2022-04-28 03:48:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:48:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 41 [2022-04-28 03:48:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 03:48:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-04-28 03:48:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 03:48:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-04-28 03:48:36,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 112 transitions. [2022-04-28 03:48:36,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:36,879 INFO L225 Difference]: With dead ends: 418 [2022-04-28 03:48:36,880 INFO L226 Difference]: Without dead ends: 408 [2022-04-28 03:48:36,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:48:36,880 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:36,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 60 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:48:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-28 03:48:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 273. [2022-04-28 03:48:40,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:40,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:40,096 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:40,096 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:40,102 INFO L93 Difference]: Finished difference Result 408 states and 545 transitions. [2022-04-28 03:48:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 545 transitions. [2022-04-28 03:48:40,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:40,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:40,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-28 03:48:40,103 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 408 states. [2022-04-28 03:48:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:40,109 INFO L93 Difference]: Finished difference Result 408 states and 545 transitions. [2022-04-28 03:48:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 545 transitions. [2022-04-28 03:48:40,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:40,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:40,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:40,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 365 transitions. [2022-04-28 03:48:40,113 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 365 transitions. Word has length 41 [2022-04-28 03:48:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:40,114 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 365 transitions. [2022-04-28 03:48:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 03:48:40,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 365 transitions. [2022-04-28 03:48:59,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 362 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 365 transitions. [2022-04-28 03:48:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:48:59,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:59,409 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:59,427 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 03:48:59,610 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,SelfDestructingSolverStorable43 [2022-04-28 03:48:59,610 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 831225272, now seen corresponding path program 15 times [2022-04-28 03:48:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:59,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432045697] [2022-04-28 03:48:59,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:59,834 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:59,836 INFO L85 PathProgramCache]: Analyzing trace with hash 171192631, now seen corresponding path program 1 times [2022-04-28 03:48:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:59,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447173075] [2022-04-28 03:48:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:59,847 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:48:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:59,867 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:49:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:00,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {52216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {52198#true} assume true; {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52198#true} {52198#true} #94#return; {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {52198#true} call ULTIMATE.init(); {52216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:00,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {52216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {52198#true} assume true; {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52198#true} {52198#true} #94#return; {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {52198#true} call #t~ret17 := main(); {52198#true} is VALID [2022-04-28 03:49:00,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {52198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52198#true} is VALID [2022-04-28 03:49:00,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {52198#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52198#true} is VALID [2022-04-28 03:49:00,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {52198#true} [177] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {52198#true} is VALID [2022-04-28 03:49:00,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {52198#true} ~z~0 := ~y~0; {52203#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:49:00,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {52203#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52204#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:00,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {52204#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52205#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:00,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {52205#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52206#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:49:00,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {52206#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52207#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:49:00,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {52207#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52208#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ 5 main_~z~0))) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ 5 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:49:00,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {52208#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ 5 main_~z~0))) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ 5 main_~z~0) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52209#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:49:00,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {52209#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52209#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-28 03:49:02,203 WARN L290 TraceCheckUtils]: 16: Hoare triple {52209#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52210#(or (<= main_~z~0 (+ 4294967295 (* (div (+ (- 4294967292) main_~z~0) 4294967296) 4294967296))) (<= (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 1) main_~z~0))} is UNKNOWN [2022-04-28 03:49:02,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {52210#(or (<= main_~z~0 (+ 4294967295 (* (div (+ (- 4294967292) main_~z~0) 4294967296) 4294967296))) (<= (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52211#(or (<= (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 2) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967293)) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:02,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {52211#(or (<= (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 2) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967293)) 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; {52212#(or (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 4294967294)) 4294967296) 4294967296))) (<= (+ 3 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:49:02,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {52212#(or (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 4294967294)) 4294967296) 4294967296))) (<= (+ 3 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52213#(or (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 (- 4294967295)) 4294967296)) 4294967298)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 4) main_~z~0))} is VALID [2022-04-28 03:49:02,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {52213#(or (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 (- 4294967295)) 4294967296)) 4294967298)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 4) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52214#(or (<= (+ 5 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967296)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-28 03:49:02,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {52214#(or (<= (+ 5 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967296)) 4294967296) 4294967296) 4294967299)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {52199#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {52199#false} assume !(~y~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L272 TraceCheckUtils]: 33: Hoare triple {52199#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {52199#false} ~cond := #in~cond; {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {52199#false} assume 0 == ~cond; {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {52199#false} assume !false; {52199#false} is VALID [2022-04-28 03:49:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:49:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:02,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447173075] [2022-04-28 03:49:02,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447173075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:02,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12543417] [2022-04-28 03:49:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:02,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:02,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:02,217 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 03:49:02,218 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 03:49:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:02,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:49:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:02,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:02,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {52198#true} call ULTIMATE.init(); {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {52198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {52198#true} assume true; {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52198#true} {52198#true} #94#return; {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {52198#true} call #t~ret17 := main(); {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {52198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {52198#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52198#true} is VALID [2022-04-28 03:49:02,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {52198#true} [177] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {52198#true} is VALID [2022-04-28 03:49:02,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {52198#true} ~z~0 := ~y~0; {52203#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:49:02,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {52203#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52247#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:02,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {52247#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52251#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:02,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {52251#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52255#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:49:02,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {52255#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52259#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:49:02,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {52259#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52263#(and (<= main_~y~0 (+ 5 main_~z~0)) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:49:02,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {52263#(and (<= main_~y~0 (+ 5 main_~z~0)) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52267#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:49:02,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {52267#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {52267#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:49:02,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {52267#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52274#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:02,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {52274#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52278#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:02,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {52278#(< 0 (mod (+ main_~z~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; {52282#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:02,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {52282#(< 0 (mod (+ main_~z~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; {52286#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:02,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {52286#(< 0 (mod (+ main_~z~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; {52290#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:02,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {52290#(< 0 (mod (+ main_~z~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; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:02,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:02,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {52199#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52199#false} is VALID [2022-04-28 03:49:02,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {52199#false} assume !(~y~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:02,851 INFO L272 TraceCheckUtils]: 33: Hoare triple {52199#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52199#false} is VALID [2022-04-28 03:49:02,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {52199#false} ~cond := #in~cond; {52199#false} is VALID [2022-04-28 03:49:02,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {52199#false} assume 0 == ~cond; {52199#false} is VALID [2022-04-28 03:49:02,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {52199#false} assume !false; {52199#false} is VALID [2022-04-28 03:49:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:49:02,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:03,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {52199#false} assume !false; {52199#false} is VALID [2022-04-28 03:49:03,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {52199#false} assume 0 == ~cond; {52199#false} is VALID [2022-04-28 03:49:03,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {52199#false} ~cond := #in~cond; {52199#false} is VALID [2022-04-28 03:49:03,093 INFO L272 TraceCheckUtils]: 33: Hoare triple {52199#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52199#false} is VALID [2022-04-28 03:49:03,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {52199#false} assume !(~y~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:03,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {52199#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52199#false} is VALID [2022-04-28 03:49:03,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52199#false} is VALID [2022-04-28 03:49:03,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {52290#(< 0 (mod (+ main_~z~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; {52215#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:49:03,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {52286#(< 0 (mod (+ main_~z~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; {52290#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:03,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {52282#(< 0 (mod (+ main_~z~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; {52286#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:03,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {52278#(< 0 (mod (+ main_~z~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; {52282#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:03,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {52274#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52278#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:03,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {52399#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52274#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:03,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {52399#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {52399#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:03,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {52274#(< 0 (mod (+ 5 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; {52399#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:03,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {52278#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52274#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:03,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {52282#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52278#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:03,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {52286#(< 0 (mod (+ main_~z~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; {52282#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:03,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {52290#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52286#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {52198#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52290#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {52198#true} ~z~0 := ~y~0; {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {52198#true} [177] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {52198#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {52198#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {52198#true} call #t~ret17 := main(); {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52198#true} {52198#true} #94#return; {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {52198#true} assume true; {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {52198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {52198#true} is VALID [2022-04-28 03:49:03,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {52198#true} call ULTIMATE.init(); {52198#true} is VALID [2022-04-28 03:49:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:49:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12543417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:03,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:03,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 9] total 28 [2022-04-28 03:49:03,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:03,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432045697] [2022-04-28 03:49:03,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432045697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:03,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:03,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:49:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839990342] [2022-04-28 03:49:03,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-28 03:49:03,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:03,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:49:03,498 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 03:49:03,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:49:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:49:03,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:49:03,498 INFO L87 Difference]: Start difference. First operand 273 states and 365 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:49:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:56,027 INFO L93 Difference]: Finished difference Result 407 states and 514 transitions. [2022-04-28 03:49:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:49:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-28 03:49:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:49:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-28 03:49:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:49:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-28 03:49:56,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 135 transitions. [2022-04-28 03:49:57,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:57,868 INFO L225 Difference]: With dead ends: 407 [2022-04-28 03:49:57,868 INFO L226 Difference]: Without dead ends: 400 [2022-04-28 03:49:57,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=856, Invalid=6800, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:49:57,869 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:57,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 90 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-28 03:49:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-28 03:50:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 282. [2022-04-28 03:50:00,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:00,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:00,362 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:00,362 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:00,368 INFO L93 Difference]: Finished difference Result 400 states and 506 transitions. [2022-04-28 03:50:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 506 transitions. [2022-04-28 03:50:00,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:00,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:00,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 400 states. [2022-04-28 03:50:00,368 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 400 states. [2022-04-28 03:50:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:00,374 INFO L93 Difference]: Finished difference Result 400 states and 506 transitions. [2022-04-28 03:50:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 506 transitions. [2022-04-28 03:50:00,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:00,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:00,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:00,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 375 transitions. [2022-04-28 03:50:00,378 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 375 transitions. Word has length 41 [2022-04-28 03:50:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:00,378 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 375 transitions. [2022-04-28 03:50:00,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:00,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 282 states and 375 transitions. [2022-04-28 03:50:25,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 372 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 375 transitions. [2022-04-28 03:50:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:50:25,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:25,935 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:25,959 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 03:50:26,145 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,SelfDestructingSolverStorable44 [2022-04-28 03:50:26,145 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -63546664, now seen corresponding path program 16 times [2022-04-28 03:50:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:26,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352638764] [2022-04-28 03:50:26,344 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:50:26,346 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 652823, now seen corresponding path program 1 times [2022-04-28 03:50:26,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:26,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372688733] [2022-04-28 03:50:26,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:26,358 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,369 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:50:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {54762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54744#true} is VALID [2022-04-28 03:50:26,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {54744#true} assume true; {54744#true} is VALID [2022-04-28 03:50:26,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54744#true} {54744#true} #94#return; {54744#true} is VALID [2022-04-28 03:50:26,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {54744#true} call ULTIMATE.init(); {54762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:26,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {54762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54744#true} is VALID [2022-04-28 03:50:26,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {54744#true} assume true; {54744#true} is VALID [2022-04-28 03:50:26,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54744#true} {54744#true} #94#return; {54744#true} is VALID [2022-04-28 03:50:26,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {54744#true} call #t~ret17 := main(); {54744#true} is VALID [2022-04-28 03:50:26,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {54744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54744#true} is VALID [2022-04-28 03:50:26,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {54744#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54744#true} is VALID [2022-04-28 03:50:26,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {54744#true} [179] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {54749#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:26,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {54749#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {54749#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:26,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {54749#(<= 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; {54750#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:26,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {54750#(<= 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; {54751#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {54751#(<= 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; {54752#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {54752#(<= 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; {54753#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {54753#(<= 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; {54754#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:50:26,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {54754#(<= 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; {54755#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {54755#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54756#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {54756#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54757#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:26,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {54757#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54758#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:50:26,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {54758#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {54759#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:50:26,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {54759#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~y~0 % 4294967296 > 0); {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:26,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {54760#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {54761#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} is VALID [2022-04-28 03:50:26,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {54761#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54745#false} is VALID [2022-04-28 03:50:26,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {54745#false} assume !(~z~0 % 4294967296 > 0); {54745#false} is VALID [2022-04-28 03:50:26,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {54745#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {54745#false} assume !(~y~0 % 4294967296 > 0); {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L272 TraceCheckUtils]: 33: Hoare triple {54745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {54745#false} ~cond := #in~cond; {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {54745#false} assume 0 == ~cond; {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {54745#false} assume !false; {54745#false} is VALID [2022-04-28 03:50:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:50:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:26,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372688733] [2022-04-28 03:50:26,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372688733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:26,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124305453] [2022-04-28 03:50:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:26,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:26,571 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 03:50:26,588 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 03:50:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:50:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:26,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {54744#true} call ULTIMATE.init(); {54744#true} is VALID [2022-04-28 03:50:26,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {54744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54744#true} is VALID [2022-04-28 03:50:26,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {54744#true} assume true; {54744#true} is VALID [2022-04-28 03:50:26,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54744#true} {54744#true} #94#return; {54744#true} is VALID [2022-04-28 03:50:26,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {54744#true} call #t~ret17 := main(); {54744#true} is VALID [2022-04-28 03:50:26,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {54744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54744#true} is VALID [2022-04-28 03:50:26,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {54744#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54744#true} is VALID [2022-04-28 03:50:26,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {54744#true} [179] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {54744#true} is VALID [2022-04-28 03:50:26,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {54744#true} ~z~0 := ~y~0; {54790#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:26,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {54790#(= 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; {54794#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:50:26,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {54794#(= 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; {54798#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:26,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {54798#(= (+ 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; {54802#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:26,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {54802#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54806#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:26,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {54806#(= (+ main_~y~0 (- 3)) (+ 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; {54810#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:26,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {54810#(= (+ main_~y~0 (- 4)) (+ 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; {54814#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:26,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {54814#(= (+ main_~y~0 (- 4)) (+ 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {54818#(< 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; {54837#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {54837#(< 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; {54841#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:26,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {54841#(< 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; {54845#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:50:26,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {54845#(< 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; {54849#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:50:26,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {54849#(< 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; {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:26,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {54853#(< 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; {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:26,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {54857#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:26,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {54857#(< 0 (mod main_~y~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; {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:26,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:26,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:26,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:26,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {54857#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54745#false} is VALID [2022-04-28 03:50:26,996 INFO L272 TraceCheckUtils]: 33: Hoare triple {54745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54745#false} is VALID [2022-04-28 03:50:26,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {54745#false} ~cond := #in~cond; {54745#false} is VALID [2022-04-28 03:50:26,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {54745#false} assume 0 == ~cond; {54745#false} is VALID [2022-04-28 03:50:26,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {54745#false} assume !false; {54745#false} is VALID [2022-04-28 03:50:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:50:26,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:27,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {54745#false} assume !false; {54745#false} is VALID [2022-04-28 03:50:27,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {54745#false} assume 0 == ~cond; {54745#false} is VALID [2022-04-28 03:50:27,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {54745#false} ~cond := #in~cond; {54745#false} is VALID [2022-04-28 03:50:27,350 INFO L272 TraceCheckUtils]: 33: Hoare triple {54745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54745#false} is VALID [2022-04-28 03:50:27,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {54857#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54745#false} is VALID [2022-04-28 03:50:27,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:27,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:27,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:27,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {54857#(< 0 (mod main_~y~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; {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:27,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {54857#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:27,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {54853#(< 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; {54857#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:50:27,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {54849#(< 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; {54853#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:50:27,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {54845#(< 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; {54849#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:50:27,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {54841#(< 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; {54845#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:50:27,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {54837#(< 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; {54841#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {54818#(< 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; {54837#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {54818#(< 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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {54951#(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; {54818#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:50:27,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {54955#(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; {54951#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:50:27,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {54959#(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; {54955#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:50:27,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {54963#(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; {54959#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:50:27,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {54967#(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; {54963#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:50:27,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {54971#(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; {54967#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:50:27,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {54975#(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; {54971#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:50:27,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {54744#true} ~z~0 := ~y~0; {54975#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:50:27,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {54744#true} [179] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {54744#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {54744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {54744#true} call #t~ret17 := main(); {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54744#true} {54744#true} #94#return; {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {54744#true} assume true; {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {54744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {54744#true} call ULTIMATE.init(); {54744#true} is VALID [2022-04-28 03:50:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 35 proven. 44 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:50:27,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124305453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:27,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:27,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2022-04-28 03:50:27,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:27,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352638764] [2022-04-28 03:50:27,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352638764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:27,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:27,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:50:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747024292] [2022-04-28 03:50:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-28 03:50:27,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:27,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:27,909 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 03:50:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:50:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:50:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1555, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:50:27,910 INFO L87 Difference]: Start difference. First operand 282 states and 375 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:41,767 INFO L93 Difference]: Finished difference Result 784 states and 1120 transitions. [2022-04-28 03:50:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:50:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-28 03:50:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 244 transitions. [2022-04-28 03:50:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 244 transitions. [2022-04-28 03:50:41,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 244 transitions. [2022-04-28 03:50:42,168 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 03:50:42,192 INFO L225 Difference]: With dead ends: 784 [2022-04-28 03:50:42,192 INFO L226 Difference]: Without dead ends: 691 [2022-04-28 03:50:42,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=458, Invalid=3702, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:50:42,193 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 251 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:42,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 110 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:50:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-28 03:50:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 293. [2022-04-28 03:50:46,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:46,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:46,423 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:46,423 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:46,436 INFO L93 Difference]: Finished difference Result 691 states and 957 transitions. [2022-04-28 03:50:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 957 transitions. [2022-04-28 03:50:46,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:46,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:46,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 03:50:46,437 INFO L87 Difference]: Start difference. First operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 691 states. [2022-04-28 03:50:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:46,450 INFO L93 Difference]: Finished difference Result 691 states and 957 transitions. [2022-04-28 03:50:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 957 transitions. [2022-04-28 03:50:46,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:46,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:46,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:46,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 390 transitions. [2022-04-28 03:50:46,455 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 390 transitions. Word has length 41 [2022-04-28 03:50:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:46,455 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 390 transitions. [2022-04-28 03:50:46,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:50:46,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 390 transitions. [2022-04-28 03:51:14,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 387 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 390 transitions. [2022-04-28 03:51:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:51:14,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:14,928 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:14,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 03:51:15,129 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,SelfDestructingSolverStorable45 [2022-04-28 03:51:15,129 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:15,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1383374916, now seen corresponding path program 10 times [2022-04-28 03:51:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:15,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069096710] [2022-04-28 03:51:15,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:51:15,326 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 684750278, now seen corresponding path program 1 times [2022-04-28 03:51:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:15,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877654990] [2022-04-28 03:51:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:15,338 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:51:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:15,358 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:51:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:15,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {58602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58592#true} is VALID [2022-04-28 03:51:15,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {58592#true} assume true; {58592#true} is VALID [2022-04-28 03:51:15,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58592#true} {58592#true} #94#return; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {58592#true} call ULTIMATE.init(); {58602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {58602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {58592#true} assume true; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58592#true} {58592#true} #94#return; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {58592#true} call #t~ret17 := main(); {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {58592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {58592#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {58592#true} [181] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {58592#true} ~z~0 := ~y~0; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {58592#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58592#true} is VALID [2022-04-28 03:51:15,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {58592#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58592#true} is VALID [2022-04-28 03:51:15,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {58592#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58592#true} is VALID [2022-04-28 03:51:15,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {58592#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58592#true} is VALID [2022-04-28 03:51:15,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {58592#true} assume !(~z~0 % 4294967296 > 0); {58597#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:51:15,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {58597#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58598#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:51:15,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {58598#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58599#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:51:15,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {58599#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {58600#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:15,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {58600#(<= main_~z~0 (+ 3 (* (div (+ main_~z~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; {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 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; {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 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; {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 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; {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 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; {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:51:15,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {58601#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58600#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:15,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {58600#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58599#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:51:15,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {58599#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58598#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:51:15,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {58598#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58597#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {58597#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {58593#false} assume !(~z~0 % 4294967296 > 0); {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {58593#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {58593#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {58593#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {58593#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {58593#false} assume !(~y~0 % 4294967296 > 0); {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L272 TraceCheckUtils]: 35: Hoare triple {58593#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58593#false} is VALID [2022-04-28 03:51:15,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {58593#false} ~cond := #in~cond; {58593#false} is VALID [2022-04-28 03:51:15,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {58593#false} assume 0 == ~cond; {58593#false} is VALID [2022-04-28 03:51:15,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {58593#false} assume !false; {58593#false} is VALID [2022-04-28 03:51:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:51:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877654990] [2022-04-28 03:51:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877654990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40039409] [2022-04-28 03:51:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:15,447 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 03:51:15,448 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 03:51:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:15,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 03:51:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:15,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:15,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {58592#true} call ULTIMATE.init(); {58592#true} is VALID [2022-04-28 03:51:15,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {58592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58592#true} is VALID [2022-04-28 03:51:15,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {58592#true} assume true; {58592#true} is VALID [2022-04-28 03:51:15,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58592#true} {58592#true} #94#return; {58592#true} is VALID [2022-04-28 03:51:15,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {58592#true} call #t~ret17 := main(); {58592#true} is VALID [2022-04-28 03:51:15,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {58592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58592#true} is VALID [2022-04-28 03:51:15,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {58592#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58592#true} is VALID [2022-04-28 03:51:15,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {58592#true} [181] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58592#true} is VALID [2022-04-28 03:51:15,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {58592#true} ~z~0 := ~y~0; {58630#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:15,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {58630#(= 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; {58634#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:51:15,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {58634#(= 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; {58638#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:51:15,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {58638#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58642#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:51:15,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {58642#(= 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; {58646#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:51:15,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {58646#(= main_~y~0 (+ main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {58646#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:51:15,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {58646#(= main_~y~0 (+ main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58638#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:51:15,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {58638#(= main_~y~0 (+ main_~z~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; {58630#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:15,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {58630#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58659#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:51:15,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {58659#(= (+ (- 1) main_~z~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; {58663#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-28 03:51:15,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {58663#(= main_~z~0 (+ main_~y~0 4))} assume !(~y~0 % 4294967296 > 0); {58663#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-28 03:51:15,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {58663#(= main_~z~0 (+ 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; {58670#(= main_~y~0 (+ main_~z~0 (- 3)))} is VALID [2022-04-28 03:51:15,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {58670#(= main_~y~0 (+ main_~z~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; {58659#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:51:15,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {58659#(= (+ (- 1) main_~z~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; {58677#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-28 03:51:15,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {58677#(= main_~y~0 (+ (- 1) main_~z~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; {58630#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:15,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {58630#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {58630#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:15,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {58630#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58634#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:51:15,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {58634#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58638#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:51:15,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {58638#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58642#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:51:15,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {58642#(= main_~y~0 (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58646#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:51:15,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {58646#(= main_~y~0 (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:51:15,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:51:15,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58706#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:51:15,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {58706#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58710#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:51:15,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {58710#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:51:15,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {58714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:51:15,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {58718#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {58593#false} is VALID [2022-04-28 03:51:15,828 INFO L272 TraceCheckUtils]: 35: Hoare triple {58593#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58593#false} is VALID [2022-04-28 03:51:15,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {58593#false} ~cond := #in~cond; {58593#false} is VALID [2022-04-28 03:51:15,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {58593#false} assume 0 == ~cond; {58593#false} is VALID [2022-04-28 03:51:15,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {58593#false} assume !false; {58593#false} is VALID [2022-04-28 03:51:15,829 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 03:51:15,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:16,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {58593#false} assume !false; {58593#false} is VALID [2022-04-28 03:51:16,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {58593#false} assume 0 == ~cond; {58593#false} is VALID [2022-04-28 03:51:16,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {58593#false} ~cond := #in~cond; {58593#false} is VALID [2022-04-28 03:51:16,420 INFO L272 TraceCheckUtils]: 35: Hoare triple {58593#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58593#false} is VALID [2022-04-28 03:51:16,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {58718#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {58593#false} is VALID [2022-04-28 03:51:16,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {58714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58718#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:51:16,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {58710#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:51:16,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {58706#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58710#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:51:16,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58706#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:51:16,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:51:16,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58699#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:51:16,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {58768#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {58772#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58768#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {58776#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58772#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {58780#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58776#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {58780#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58780#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {58787#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~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; {58780#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {58791#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~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; {58787#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:16,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {58795#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~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; {58791#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:51:16,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {58799#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~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; {58795#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:51:16,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {58799#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58799#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:51:16,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {58806#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {58799#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:51:16,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {58810#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58806#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:51:16,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {58814#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {58810#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:51:16,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {58814#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:16,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {58768#(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; {58764#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {58772#(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; {58768#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {58776#(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; {58772#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {58780#(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; {58776#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {58592#true} ~z~0 := ~y~0; {58780#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:51:16,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {58592#true} [181] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58592#true} is VALID [2022-04-28 03:51:16,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {58592#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58592#true} is VALID [2022-04-28 03:51:16,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {58592#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58592#true} is VALID [2022-04-28 03:51:16,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {58592#true} call #t~ret17 := main(); {58592#true} is VALID [2022-04-28 03:51:16,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58592#true} {58592#true} #94#return; {58592#true} is VALID [2022-04-28 03:51:16,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {58592#true} assume true; {58592#true} is VALID [2022-04-28 03:51:16,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {58592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58592#true} is VALID [2022-04-28 03:51:16,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {58592#true} call ULTIMATE.init(); {58592#true} is VALID [2022-04-28 03:51:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:16,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40039409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:16,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:16,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 19] total 34 [2022-04-28 03:51:16,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:16,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069096710] [2022-04-28 03:51:16,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069096710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:16,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:16,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:51:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871607087] [2022-04-28 03:51:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 42 [2022-04-28 03:51:16,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:16,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 03:51:16,739 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 03:51:16,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:51:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:16,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:51:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:51:16,739 INFO L87 Difference]: Start difference. First operand 293 states and 390 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 03:51:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:23,322 INFO L93 Difference]: Finished difference Result 424 states and 543 transitions. [2022-04-28 03:51:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:51:23,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 42 [2022-04-28 03:51:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 03:51:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 87 transitions. [2022-04-28 03:51:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 03:51:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 87 transitions. [2022-04-28 03:51:23,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 87 transitions. [2022-04-28 03:51:23,450 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 03:51:23,460 INFO L225 Difference]: With dead ends: 424 [2022-04-28 03:51:23,460 INFO L226 Difference]: Without dead ends: 384 [2022-04-28 03:51:23,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=324, Invalid=2982, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:51:23,462 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:23,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:51:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-28 03:51:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2022-04-28 03:51:27,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:27,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,154 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,155 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:27,161 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-04-28 03:51:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 487 transitions. [2022-04-28 03:51:27,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:27,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:27,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 384 states. [2022-04-28 03:51:27,162 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 384 states. [2022-04-28 03:51:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:27,166 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-04-28 03:51:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 487 transitions. [2022-04-28 03:51:27,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:27,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:27,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:27,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2022-04-28 03:51:27,171 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 42 [2022-04-28 03:51:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:27,171 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2022-04-28 03:51:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 03:51:27,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 393 transitions. [2022-04-28 03:51:56,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 390 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2022-04-28 03:51:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:51:56,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:56,301 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:56,316 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 03:51:56,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 03:51:56,501 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 924637287, now seen corresponding path program 17 times [2022-04-28 03:51:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:56,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98141590] [2022-04-28 03:52:00,593 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:00,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:52:00,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 572573064, now seen corresponding path program 1 times [2022-04-28 03:52:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526507057] [2022-04-28 03:52:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:00,681 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:52:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:00,703 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:52:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:00,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {61143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61124#true} is VALID [2022-04-28 03:52:00,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-28 03:52:00,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61124#true} {61124#true} #94#return; {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {61124#true} call ULTIMATE.init(); {61143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:00,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {61143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61124#true} {61124#true} #94#return; {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {61124#true} call #t~ret17 := main(); {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {61124#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {61124#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61124#true} is VALID [2022-04-28 03:52:00,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {61124#true} [183] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {61124#true} is VALID [2022-04-28 03:52:00,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {61124#true} ~z~0 := ~y~0; {61129#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:52:00,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {61129#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61130#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:52:00,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {61130#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61131#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:52:00,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {61131#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61132#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:52:00,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {61132#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61133#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:52:00,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {61133#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61134#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:52:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {61134#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61135#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:52:00,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {61135#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {61136#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:52:00,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {61136#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61137#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:00,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {61137#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {61138#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:00,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {61138#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61139#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:00,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {61139#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61140#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:00,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {61140#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61141#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {61141#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61142#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {61142#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {61125#false} assume !(~y~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {61125#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; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {61125#false} assume !(~x~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {61125#false} assume !(~z~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {61125#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {61125#false} assume !(~y~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L272 TraceCheckUtils]: 34: Hoare triple {61125#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {61125#false} ~cond := #in~cond; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {61125#false} assume 0 == ~cond; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {61125#false} assume !false; {61125#false} is VALID [2022-04-28 03:52:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:52:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:00,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526507057] [2022-04-28 03:52:00,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526507057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161917508] [2022-04-28 03:52:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:00,929 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 03:52:00,930 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 03:52:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:52:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:00,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:01,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {61124#true} call ULTIMATE.init(); {61124#true} is VALID [2022-04-28 03:52:01,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {61124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61124#true} is VALID [2022-04-28 03:52:01,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-28 03:52:01,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61124#true} {61124#true} #94#return; {61124#true} is VALID [2022-04-28 03:52:01,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {61124#true} call #t~ret17 := main(); {61124#true} is VALID [2022-04-28 03:52:01,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {61124#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61124#true} is VALID [2022-04-28 03:52:01,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {61124#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61124#true} is VALID [2022-04-28 03:52:01,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {61124#true} [183] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {61124#true} is VALID [2022-04-28 03:52:01,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {61124#true} ~z~0 := ~y~0; {61129#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:52:01,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {61129#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61130#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:52:01,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {61130#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61131#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:52:01,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {61131#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:01,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:01,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:01,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:01,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:01,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-28 03:52:01,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-28 03:52:01,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-28 03:52:01,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 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; {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-28 03:52:01,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 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; {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-28 03:52:01,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-28 03:52:01,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 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; {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-28 03:52:01,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 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; {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-28 03:52:01,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 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; {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-28 03:52:01,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-28 03:52:01,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:01,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:01,788 INFO L272 TraceCheckUtils]: 34: Hoare triple {61125#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61125#false} is VALID [2022-04-28 03:52:01,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {61125#false} ~cond := #in~cond; {61125#false} is VALID [2022-04-28 03:52:01,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {61125#false} assume 0 == ~cond; {61125#false} is VALID [2022-04-28 03:52:01,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {61125#false} assume !false; {61125#false} is VALID [2022-04-28 03:52:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:52:01,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:02,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {61125#false} assume !false; {61125#false} is VALID [2022-04-28 03:52:02,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {61125#false} assume 0 == ~cond; {61125#false} is VALID [2022-04-28 03:52:02,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {61125#false} ~cond := #in~cond; {61125#false} is VALID [2022-04-28 03:52:02,265 INFO L272 TraceCheckUtils]: 34: Hoare triple {61125#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61125#false} is VALID [2022-04-28 03:52:02,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61125#false} is VALID [2022-04-28 03:52:02,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 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; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-28 03:52:02,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 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; {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-28 03:52:02,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 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; {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-28 03:52:02,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 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; {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-28 03:52:02,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-28 03:52:02,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 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; {61220#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-28 03:52:02,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 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; {61216#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-28 03:52:02,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 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; {61212#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-28 03:52:02,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61208#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-28 03:52:02,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61204#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-28 03:52:02,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61200#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61196#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:52:02,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:02,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:02,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:02,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:02,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {61344#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61180#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:52:02,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {61348#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61344#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-28 03:52:02,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {61352#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61348#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-28 03:52:02,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {61124#true} ~z~0 := ~y~0; {61352#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-28 03:52:02,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {61124#true} [183] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {61124#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {61124#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {61124#true} call #t~ret17 := main(); {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61124#true} {61124#true} #94#return; {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {61124#true} assume true; {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {61124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {61124#true} is VALID [2022-04-28 03:52:02,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {61124#true} call ULTIMATE.init(); {61124#true} is VALID [2022-04-28 03:52:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:52:02,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161917508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:02,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:02,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 28 [2022-04-28 03:52:02,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:02,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98141590] [2022-04-28 03:52:02,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98141590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:02,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:02,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:52:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927885698] [2022-04-28 03:52:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 42 [2022-04-28 03:52:02,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:02,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 03:52:02,710 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 03:52:02,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:52:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:52:02,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:52:02,722 INFO L87 Difference]: Start difference. First operand 299 states and 393 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 03:52:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:16,493 INFO L93 Difference]: Finished difference Result 716 states and 933 transitions. [2022-04-28 03:52:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:52:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 42 [2022-04-28 03:52:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 03:52:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 212 transitions. [2022-04-28 03:52:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 03:52:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 212 transitions. [2022-04-28 03:52:16,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 212 transitions. [2022-04-28 03:52:16,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:16,776 INFO L225 Difference]: With dead ends: 716 [2022-04-28 03:52:16,777 INFO L226 Difference]: Without dead ends: 442 [2022-04-28 03:52:16,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1281, Invalid=7275, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 03:52:16,778 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 129 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:16,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 98 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 03:52:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-28 03:52:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 303. [2022-04-28 03:52:19,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:19,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:19,500 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:19,500 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:19,507 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-04-28 03:52:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-04-28 03:52:19,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:19,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:19,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-28 03:52:19,507 INFO L87 Difference]: Start difference. First operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-28 03:52:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:19,514 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-04-28 03:52:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-04-28 03:52:19,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:19,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:19,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:19,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 395 transitions. [2022-04-28 03:52:19,519 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 395 transitions. Word has length 42 [2022-04-28 03:52:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:19,519 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 395 transitions. [2022-04-28 03:52:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 03:52:19,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 395 transitions. [2022-04-28 03:52:55,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 391 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 395 transitions. [2022-04-28 03:52:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:52:55,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:55,625 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:55,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:55,826 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 777159737, now seen corresponding path program 18 times [2022-04-28 03:52:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:55,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1270932983] [2022-04-28 03:52:58,017 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:52:58,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash -426349737, now seen corresponding path program 1 times [2022-04-28 03:52:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:58,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029003501] [2022-04-28 03:52:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:58,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:52:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:58,053 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:52:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:58,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {64451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64432#true} is VALID [2022-04-28 03:52:58,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {64432#true} assume true; {64432#true} is VALID [2022-04-28 03:52:58,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64432#true} {64432#true} #94#return; {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {64432#true} call ULTIMATE.init(); {64451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:58,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {64451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {64432#true} assume true; {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64432#true} {64432#true} #94#return; {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {64432#true} call #t~ret17 := main(); {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {64432#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64432#true} is VALID [2022-04-28 03:52:58,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {64432#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64432#true} is VALID [2022-04-28 03:52:58,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {64432#true} [185] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {64437#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:52:58,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {64437#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {64437#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:52:58,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {64437#(<= 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; {64438#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:52:58,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {64438#(<= 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; {64439#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {64439#(<= 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; {64440#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {64440#(<= 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; {64441#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {64441#(<= 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; {64442#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:58,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {64442#(<= 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; {64443#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {64443#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64444#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {64444#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64445#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:58,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {64445#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64446#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:52:58,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {64446#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {64447#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:52:58,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {64447#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64448#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:52:58,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {64448#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~y~0 % 4294967296 > 0); {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:52:58,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {64449#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64450#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} is VALID [2022-04-28 03:52:58,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {64450#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {64433#false} is VALID [2022-04-28 03:52:58,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {64433#false} assume !(~z~0 % 4294967296 > 0); {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {64433#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {64433#false} assume !(~y~0 % 4294967296 > 0); {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L272 TraceCheckUtils]: 34: Hoare triple {64433#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {64433#false} ~cond := #in~cond; {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {64433#false} assume 0 == ~cond; {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {64433#false} assume !false; {64433#false} is VALID [2022-04-28 03:52:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:52:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:58,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029003501] [2022-04-28 03:52:58,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029003501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:58,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105227688] [2022-04-28 03:52:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:58,291 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 03:52:58,293 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 03:52:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:58,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:52:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:58,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:58,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {64432#true} call ULTIMATE.init(); {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {64432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {64432#true} assume true; {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64432#true} {64432#true} #94#return; {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {64432#true} call #t~ret17 := main(); {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {64432#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {64432#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {64432#true} [185] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {64432#true} is VALID [2022-04-28 03:52:58,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {64432#true} ~z~0 := ~y~0; {64479#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:52:58,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {64479#(= 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; {64483#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:52:58,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {64483#(= 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; {64487#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:52:58,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {64487#(= (+ 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; {64491#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:52:58,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {64491#(= (+ (- 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; {64495#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:52:58,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {64495#(= (+ main_~y~0 (- 3)) (+ 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; {64499#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:52:58,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {64499#(= (+ main_~y~0 (- 4)) (+ 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; {64503#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:52:58,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {64503#(= (+ main_~y~0 (- 5)) (+ 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {64507#(< 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; {64529#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {64529#(< 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; {64533#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:58,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {64533#(< 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; {64537#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:52:58,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {64537#(< 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; {64541#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:52:58,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {64541#(< 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; {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:58,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {64545#(< 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; {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:58,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {64549#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:58,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {64549#(< 0 (mod main_~y~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; {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:58,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:58,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:58,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:58,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {64549#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64433#false} is VALID [2022-04-28 03:52:58,828 INFO L272 TraceCheckUtils]: 34: Hoare triple {64433#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64433#false} is VALID [2022-04-28 03:52:58,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {64433#false} ~cond := #in~cond; {64433#false} is VALID [2022-04-28 03:52:58,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {64433#false} assume 0 == ~cond; {64433#false} is VALID [2022-04-28 03:52:58,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {64433#false} assume !false; {64433#false} is VALID [2022-04-28 03:52:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 03:52:58,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:59,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {64433#false} assume !false; {64433#false} is VALID [2022-04-28 03:52:59,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {64433#false} assume 0 == ~cond; {64433#false} is VALID [2022-04-28 03:52:59,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {64433#false} ~cond := #in~cond; {64433#false} is VALID [2022-04-28 03:52:59,262 INFO L272 TraceCheckUtils]: 34: Hoare triple {64433#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64433#false} is VALID [2022-04-28 03:52:59,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {64549#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64433#false} is VALID [2022-04-28 03:52:59,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:59,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:59,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:59,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {64549#(< 0 (mod main_~y~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; {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:59,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {64549#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:59,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {64545#(< 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; {64549#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:59,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {64541#(< 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; {64545#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:59,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {64537#(< 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; {64541#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:52:59,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {64533#(< 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; {64537#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:52:59,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {64529#(< 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; {64533#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {64507#(< 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; {64529#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {64507#(< 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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {64646#(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; {64507#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:59,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {64650#(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; {64646#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:59,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {64654#(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; {64650#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:59,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {64658#(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; {64654#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:59,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {64662#(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; {64658#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:59,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {64666#(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; {64662#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:59,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {64670#(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; {64666#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:52:59,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {64432#true} ~z~0 := ~y~0; {64670#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:52:59,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {64432#true} [185] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {64432#true} is VALID [2022-04-28 03:52:59,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {64432#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64432#true} is VALID [2022-04-28 03:52:59,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {64432#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64432#true} is VALID [2022-04-28 03:52:59,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {64432#true} call #t~ret17 := main(); {64432#true} is VALID [2022-04-28 03:52:59,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64432#true} {64432#true} #94#return; {64432#true} is VALID [2022-04-28 03:52:59,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {64432#true} assume true; {64432#true} is VALID [2022-04-28 03:52:59,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {64432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64432#true} is VALID [2022-04-28 03:52:59,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {64432#true} call ULTIMATE.init(); {64432#true} is VALID [2022-04-28 03:52:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 03:52:59,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105227688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:59,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:59,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-28 03:53:00,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1270932983] [2022-04-28 03:53:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1270932983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:00,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:00,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:53:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305907674] [2022-04-28 03:53:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:00,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:00,255 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), 22 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 03:53:00,303 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 03:53:00,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:53:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:00,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:53:00,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:53:00,304 INFO L87 Difference]: Start difference. First operand 303 states and 395 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:19,623 INFO L93 Difference]: Finished difference Result 940 states and 1335 transitions. [2022-04-28 03:53:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:53:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 269 transitions. [2022-04-28 03:53:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 269 transitions. [2022-04-28 03:53:19,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 269 transitions. [2022-04-28 03:53:20,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:20,071 INFO L225 Difference]: With dead ends: 940 [2022-04-28 03:53:20,071 INFO L226 Difference]: Without dead ends: 813 [2022-04-28 03:53:20,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=563, Invalid=4267, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:53:20,072 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 327 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:20,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 93 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:53:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-04-28 03:53:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 315. [2022-04-28 03:53:23,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:23,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:23,247 INFO L74 IsIncluded]: Start isIncluded. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:23,247 INFO L87 Difference]: Start difference. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:23,267 INFO L93 Difference]: Finished difference Result 813 states and 1132 transitions. [2022-04-28 03:53:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1132 transitions. [2022-04-28 03:53:23,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:23,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:23,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 813 states. [2022-04-28 03:53:23,268 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 813 states. [2022-04-28 03:53:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:23,287 INFO L93 Difference]: Finished difference Result 813 states and 1132 transitions. [2022-04-28 03:53:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1132 transitions. [2022-04-28 03:53:23,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:23,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:23,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:23,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 412 transitions. [2022-04-28 03:53:23,292 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 412 transitions. Word has length 43 [2022-04-28 03:53:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:23,292 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 412 transitions. [2022-04-28 03:53:23,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 03:53:23,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 412 transitions. [2022-04-28 03:53:57,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 407 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 412 transitions. [2022-04-28 03:53:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:53:57,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:57,924 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:57,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-28 03:53:58,124 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,SelfDestructingSolverStorable48 [2022-04-28 03:53:58,125 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:58,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1373145668, now seen corresponding path program 11 times [2022-04-28 03:53:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:58,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365100120] [2022-04-28 03:54:00,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:54:00,320 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1373536602, now seen corresponding path program 1 times [2022-04-28 03:54:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186766456] [2022-04-28 03:54:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:00,334 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:00,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:00,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {68912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68894#true} is VALID [2022-04-28 03:54:00,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {68894#true} assume true; {68894#true} is VALID [2022-04-28 03:54:00,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68894#true} {68894#true} #94#return; {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {68894#true} call ULTIMATE.init(); {68912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:00,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {68912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {68894#true} assume true; {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68894#true} {68894#true} #94#return; {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {68894#true} call #t~ret17 := main(); {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {68894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {68894#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68894#true} is VALID [2022-04-28 03:54:00,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {68894#true} [187] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {68894#true} is VALID [2022-04-28 03:54:00,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {68894#true} ~z~0 := ~y~0; {68894#true} is VALID [2022-04-28 03:54:00,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68899#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {68899#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {68900#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:54:00,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {68900#(<= main_~z~0 (+ (* (div main_~z~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; {68901#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {68901#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {68902#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {68902#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {68903#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {68903#(<= main_~z~0 (+ 4294967290 (* (div main_~z~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; {68904#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:54:00,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {68904#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !(~z~0 % 4294967296 > 0); {68904#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:54:00,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {68904#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68905#(<= main_~z~0 (+ 4294967290 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:54:00,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {68905#(<= main_~z~0 (+ 4294967290 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68906#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} is VALID [2022-04-28 03:54:00,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {68906#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68907#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {68907#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {68908#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:54:00,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {68908#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68909#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-28 03:54:00,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {68909#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~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; {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:00,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {68910#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68911#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:54:00,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {68911#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {68895#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {68895#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {68895#false} assume !(~y~0 % 4294967296 > 0); {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L272 TraceCheckUtils]: 35: Hoare triple {68895#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {68895#false} ~cond := #in~cond; {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {68895#false} assume 0 == ~cond; {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {68895#false} assume !false; {68895#false} is VALID [2022-04-28 03:54:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 03:54:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:00,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186766456] [2022-04-28 03:54:00,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186766456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546730516] [2022-04-28 03:54:00,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:00,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:00,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:00,548 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 03:54:00,548 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 03:54:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:00,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:54:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:00,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:00,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {68894#true} call ULTIMATE.init(); {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {68894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {68894#true} assume true; {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68894#true} {68894#true} #94#return; {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {68894#true} call #t~ret17 := main(); {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {68894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {68894#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {68894#true} [187] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {68894#true} ~z~0 := ~y~0; {68894#true} is VALID [2022-04-28 03:54:00,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {68894#true} assume !(~z~0 % 4294967296 > 0); {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68894#true} is VALID [2022-04-28 03:54:00,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68894#true} is VALID [2022-04-28 03:54:00,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68970#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:54:00,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {68970#(< 0 (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; {68974#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:54:00,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {68974#(< 0 (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; {68978#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:54:00,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {68978#(< 0 (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; {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:54:00,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:54:00,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {68982#(< 0 (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; {68978#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:54:00,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {68978#(< 0 (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; {68974#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:54:00,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {68974#(< 0 (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; {68970#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:54:00,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {68970#(< 0 (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; {68998#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:54:00,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {68998#(< 0 (mod main_~y~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; {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:00,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {69002#(< 0 (mod (+ main_~y~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; {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:00,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68998#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:54:00,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {68998#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {68895#false} is VALID [2022-04-28 03:54:00,835 INFO L272 TraceCheckUtils]: 35: Hoare triple {68895#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68895#false} is VALID [2022-04-28 03:54:00,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {68895#false} ~cond := #in~cond; {68895#false} is VALID [2022-04-28 03:54:00,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {68895#false} assume 0 == ~cond; {68895#false} is VALID [2022-04-28 03:54:00,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {68895#false} assume !false; {68895#false} is VALID [2022-04-28 03:54:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 03:54:00,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:00,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {68895#false} assume !false; {68895#false} is VALID [2022-04-28 03:54:00,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {68895#false} assume 0 == ~cond; {68895#false} is VALID [2022-04-28 03:54:00,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {68895#false} ~cond := #in~cond; {68895#false} is VALID [2022-04-28 03:54:00,949 INFO L272 TraceCheckUtils]: 35: Hoare triple {68895#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68895#false} is VALID [2022-04-28 03:54:00,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {68998#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {68895#false} is VALID [2022-04-28 03:54:00,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68998#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:54:00,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:00,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {69002#(< 0 (mod (+ main_~y~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; {69006#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:54:00,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {68998#(< 0 (mod main_~y~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; {69002#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:00,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {68970#(< 0 (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; {68998#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:54:00,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {68974#(< 0 (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; {68970#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:54:00,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {68978#(< 0 (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; {68974#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:54:00,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {68982#(< 0 (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; {68978#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:54:00,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:54:00,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {68978#(< 0 (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; {68982#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 03:54:00,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {68974#(< 0 (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; {68978#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 03:54:00,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {68970#(< 0 (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; {68974#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 03:54:00,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68970#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 03:54:00,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {68894#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {68894#true} assume !(~z~0 % 4294967296 > 0); {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {68894#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {68894#true} ~z~0 := ~y~0; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {68894#true} [187] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {68894#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {68894#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68894#true} is VALID [2022-04-28 03:54:00,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {68894#true} call #t~ret17 := main(); {68894#true} is VALID [2022-04-28 03:54:00,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68894#true} {68894#true} #94#return; {68894#true} is VALID [2022-04-28 03:54:00,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {68894#true} assume true; {68894#true} is VALID [2022-04-28 03:54:00,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {68894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {68894#true} is VALID [2022-04-28 03:54:00,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {68894#true} call ULTIMATE.init(); {68894#true} is VALID [2022-04-28 03:54:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 03:54:00,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546730516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:00,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:00,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 23 [2022-04-28 03:54:01,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:01,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365100120] [2022-04-28 03:54:01,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365100120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:01,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:01,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:54:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865268756] [2022-04-28 03:54:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) 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 44 [2022-04-28 03:54:01,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:01,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5454545454545454) 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 03:54:01,471 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 03:54:01,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:54:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:54:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:54:01,472 INFO L87 Difference]: Start difference. First operand 315 states and 412 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) 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 03:54:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:16,063 INFO L93 Difference]: Finished difference Result 612 states and 807 transitions. [2022-04-28 03:54:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:54:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) 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 44 [2022-04-28 03:54:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) 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 03:54:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 164 transitions. [2022-04-28 03:54:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) 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 03:54:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 164 transitions. [2022-04-28 03:54:16,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 164 transitions. [2022-04-28 03:54:16,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:16,594 INFO L225 Difference]: With dead ends: 612 [2022-04-28 03:54:16,594 INFO L226 Difference]: Without dead ends: 591 [2022-04-28 03:54:16,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=890, Invalid=5752, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:54:16,595 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:16,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 63 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:54:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-04-28 03:54:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 352. [2022-04-28 03:54:21,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:21,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:21,143 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:21,153 INFO L93 Difference]: Finished difference Result 591 states and 739 transitions. [2022-04-28 03:54:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 739 transitions. [2022-04-28 03:54:21,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:21,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:21,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 591 states. [2022-04-28 03:54:21,154 INFO L87 Difference]: Start difference. First operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 591 states. [2022-04-28 03:54:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:21,172 INFO L93 Difference]: Finished difference Result 591 states and 739 transitions. [2022-04-28 03:54:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 739 transitions. [2022-04-28 03:54:21,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:21,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:21,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:21,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 347 states have internal predecessors, (461), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 465 transitions. [2022-04-28 03:54:21,179 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 465 transitions. Word has length 44 [2022-04-28 03:54:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:21,179 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 465 transitions. [2022-04-28 03:54:21,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) 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 03:54:21,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 465 transitions. [2022-04-28 03:55:03,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 459 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 03:55:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:55:03,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:03,954 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:03,970 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 03:55:04,154 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,SelfDestructingSolverStorable49 [2022-04-28 03:55:04,154 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash -579891687, now seen corresponding path program 12 times [2022-04-28 03:55:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:04,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488915909] [2022-04-28 03:55:04,309 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:55:04,310 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2144065993, now seen corresponding path program 1 times [2022-04-28 03:55:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:04,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562672058] [2022-04-28 03:55:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:04,323 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,341 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_47.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {72393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72376#true} is VALID [2022-04-28 03:55:04,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {72376#true} assume true; {72376#true} is VALID [2022-04-28 03:55:04,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72376#true} {72376#true} #94#return; {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {72376#true} call ULTIMATE.init(); {72393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:04,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {72393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {72376#true} assume true; {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72376#true} {72376#true} #94#return; {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {72376#true} call #t~ret17 := main(); {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {72376#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {72376#true} [190] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_797 4294967296)) (.cse1 (= v_main_~x~0_797 v_main_~x~0_796)) (.cse2 (= v_main_~y~0_904 v_main_~y~0_903)) (.cse3 (= |v_main_#t~post5_230| |v_main_#t~post5_229|))) (or (and (forall ((v_it_47 Int)) (or (not (<= (+ v_main_~x~0_796 v_it_47 1) v_main_~x~0_797)) (< 0 (mod (+ v_main_~x~0_797 (* 4294967295 v_it_47)) 4294967296)) (not (<= 1 v_it_47)))) (< 0 .cse0) (= v_main_~y~0_903 (+ v_main_~x~0_797 v_main_~y~0_904 (* v_main_~x~0_796 (- 1)))) (< v_main_~x~0_796 v_main_~x~0_797)) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_229| |v_main_#t~post6_230|) .cse3) (and (= |v_main_#t~post6_230| |v_main_#t~post6_229|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_904, main_#t~post5=|v_main_#t~post5_230|, main_~x~0=v_main_~x~0_797, main_#t~post6=|v_main_#t~post6_230|} OutVars{main_~y~0=v_main_~y~0_903, main_#t~post5=|v_main_#t~post5_229|, main_~x~0=v_main_~x~0_796, main_#t~post6=|v_main_#t~post6_229|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {72376#true} is VALID [2022-04-28 03:55:04,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {72376#true} [189] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {72376#true} is VALID [2022-04-28 03:55:04,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {72376#true} ~z~0 := ~y~0; {72381#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:55:04,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {72381#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72382#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:55:04,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {72382#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72383#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:55:04,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {72383#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72384#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 3) main_~y~0))} is VALID [2022-04-28 03:55:04,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {72384#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 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; {72385#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:55:04,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {72385#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72386#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:55:04,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {72386#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72387#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ main_~z~0 6) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))))} is VALID [2022-04-28 03:55:04,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {72387#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (or (<= (+ main_~z~0 6) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div 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; {72388#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ 7 (* (div main_~y~0 4294967296) 4294967296)) main_~y~0))} is VALID [2022-04-28 03:55:04,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {72388#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ 7 (* (div main_~y~0 4294967296) 4294967296)) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {72388#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ 7 (* (div main_~y~0 4294967296) 4294967296)) main_~y~0))} is VALID [2022-04-28 03:55:04,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {72388#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ 7 (* (div main_~y~0 4294967296) 4294967296)) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72389#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 6) main_~y~0)} is VALID [2022-04-28 03:55:04,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {72389#(<= (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 6) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72390#(<= (+ 5 (* (div (+ main_~y~0 2) 4294967296) 4294967296)) main_~y~0)} is VALID [2022-04-28 03:55:04,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {72390#(<= (+ 5 (* (div (+ main_~y~0 2) 4294967296) 4294967296)) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72391#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-28 03:55:04,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {72391#(<= (+ (* (div (+ main_~y~0 3) 4294967296) 4294967296) 4) main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72392#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {72392#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {72377#false} assume !(~x~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:04,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {72377#false} assume !(~z~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {72377#false} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L272 TraceCheckUtils]: 36: Hoare triple {72377#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {72377#false} ~cond := #in~cond; {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {72377#false} assume 0 == ~cond; {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {72377#false} assume !false; {72377#false} is VALID [2022-04-28 03:55:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 03:55:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562672058] [2022-04-28 03:55:04,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562672058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974934285] [2022-04-28 03:55:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:04,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:04,551 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 03:55:04,552 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 03:55:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:55:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:04,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:05,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {72376#true} call ULTIMATE.init(); {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {72376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {72376#true} assume true; {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72376#true} {72376#true} #94#return; {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {72376#true} call #t~ret17 := main(); {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {72376#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {72376#true} [190] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_797 4294967296)) (.cse1 (= v_main_~x~0_797 v_main_~x~0_796)) (.cse2 (= v_main_~y~0_904 v_main_~y~0_903)) (.cse3 (= |v_main_#t~post5_230| |v_main_#t~post5_229|))) (or (and (forall ((v_it_47 Int)) (or (not (<= (+ v_main_~x~0_796 v_it_47 1) v_main_~x~0_797)) (< 0 (mod (+ v_main_~x~0_797 (* 4294967295 v_it_47)) 4294967296)) (not (<= 1 v_it_47)))) (< 0 .cse0) (= v_main_~y~0_903 (+ v_main_~x~0_797 v_main_~y~0_904 (* v_main_~x~0_796 (- 1)))) (< v_main_~x~0_796 v_main_~x~0_797)) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_229| |v_main_#t~post6_230|) .cse3) (and (= |v_main_#t~post6_230| |v_main_#t~post6_229|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_904, main_#t~post5=|v_main_#t~post5_230|, main_~x~0=v_main_~x~0_797, main_#t~post6=|v_main_#t~post6_230|} OutVars{main_~y~0=v_main_~y~0_903, main_#t~post5=|v_main_#t~post5_229|, main_~x~0=v_main_~x~0_796, main_#t~post6=|v_main_#t~post6_229|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {72376#true} [189] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {72376#true} is VALID [2022-04-28 03:55:05,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {72376#true} ~z~0 := ~y~0; {72381#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:55:05,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {72381#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72382#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:55:05,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {72382#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72427#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:55:05,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {72427#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72431#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:55:05,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {72431#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72435#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:55:05,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {72435#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72452#(< (div (+ (* (- 1) main_~y~0) 4294967298) (- 4294967296)) (+ (div (+ main_~y~0 (- 4)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {72452#(< (div (+ (* (- 1) main_~y~0) 4294967298) (- 4294967296)) (+ (div (+ main_~y~0 (- 4)) 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; {72456#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {72456#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {72460#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:55:05,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {72460#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72464#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {72464#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {72377#false} assume !(~x~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {72377#false} assume !(~z~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {72377#false} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L272 TraceCheckUtils]: 36: Hoare triple {72377#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {72377#false} ~cond := #in~cond; {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {72377#false} assume 0 == ~cond; {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {72377#false} assume !false; {72377#false} is VALID [2022-04-28 03:55:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 03:55:05,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:05,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {72377#false} assume !false; {72377#false} is VALID [2022-04-28 03:55:05,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {72377#false} assume 0 == ~cond; {72377#false} is VALID [2022-04-28 03:55:05,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {72377#false} ~cond := #in~cond; {72377#false} is VALID [2022-04-28 03:55:05,858 INFO L272 TraceCheckUtils]: 36: Hoare triple {72377#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {72377#false} is VALID [2022-04-28 03:55:05,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {72377#false} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {72377#false} assume !(~z~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {72377#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {72377#false} assume !(~x~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {72377#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; {72377#false} is VALID [2022-04-28 03:55:05,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {72464#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {72377#false} is VALID [2022-04-28 03:55:05,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {72460#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {72464#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:55:05,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {72456#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {72460#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:55:05,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {72452#(< (div (+ (* (- 1) main_~y~0) 4294967298) (- 4294967296)) (+ (div (+ main_~y~0 (- 4)) 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; {72456#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72452#(< (div (+ (* (- 1) main_~y~0) 4294967298) (- 4294967296)) (+ (div (+ main_~y~0 (- 4)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {72600#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72439#(< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1))} is VALID [2022-04-28 03:55:05,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {72604#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72600#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1)))} is VALID [2022-04-28 03:55:05,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {72608#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72604#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1)))} is VALID [2022-04-28 03:55:05,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {72612#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72608#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1)))} is VALID [2022-04-28 03:55:05,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {72616#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 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; {72612#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1)))} is VALID [2022-04-28 03:55:05,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {72376#true} ~z~0 := ~y~0; {72616#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< (div (+ (* (- 1) main_~y~0) 4294967299) (- 4294967296)) (+ (div (+ main_~y~0 (- 5)) 4294967296) 1)))} is VALID [2022-04-28 03:55:05,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {72376#true} [189] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {72376#true} is VALID [2022-04-28 03:55:05,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {72376#true} [190] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_797 4294967296)) (.cse1 (= v_main_~x~0_797 v_main_~x~0_796)) (.cse2 (= v_main_~y~0_904 v_main_~y~0_903)) (.cse3 (= |v_main_#t~post5_230| |v_main_#t~post5_229|))) (or (and (forall ((v_it_47 Int)) (or (not (<= (+ v_main_~x~0_796 v_it_47 1) v_main_~x~0_797)) (< 0 (mod (+ v_main_~x~0_797 (* 4294967295 v_it_47)) 4294967296)) (not (<= 1 v_it_47)))) (< 0 .cse0) (= v_main_~y~0_903 (+ v_main_~x~0_797 v_main_~y~0_904 (* v_main_~x~0_796 (- 1)))) (< v_main_~x~0_796 v_main_~x~0_797)) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_229| |v_main_#t~post6_230|) .cse3) (and (= |v_main_#t~post6_230| |v_main_#t~post6_229|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_904, main_#t~post5=|v_main_#t~post5_230|, main_~x~0=v_main_~x~0_797, main_#t~post6=|v_main_#t~post6_230|} OutVars{main_~y~0=v_main_~y~0_903, main_#t~post5=|v_main_#t~post5_229|, main_~x~0=v_main_~x~0_796, main_#t~post6=|v_main_#t~post6_229|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {72376#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {72376#true} call #t~ret17 := main(); {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72376#true} {72376#true} #94#return; {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {72376#true} assume true; {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {72376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {72376#true} is VALID [2022-04-28 03:55:05,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {72376#true} call ULTIMATE.init(); {72376#true} is VALID [2022-04-28 03:55:05,873 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 03:55:05,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974934285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:05,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:05,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 28 [2022-04-28 03:55:06,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:06,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488915909] [2022-04-28 03:55:06,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488915909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:06,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:06,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:55:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703553155] [2022-04-28 03:55:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:06,496 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 45 [2022-04-28 03:55:06,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:06,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:55:06,581 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 03:55:06,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:55:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:55:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:55:06,581 INFO L87 Difference]: Start difference. First operand 352 states and 465 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:55:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:19,980 INFO L93 Difference]: Finished difference Result 570 states and 714 transitions. [2022-04-28 03:55:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:55:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 45 [2022-04-28 03:55:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:55:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 122 transitions. [2022-04-28 03:55:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:55:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 122 transitions. [2022-04-28 03:55:19,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 122 transitions. [2022-04-28 03:55:20,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:20,185 INFO L225 Difference]: With dead ends: 570 [2022-04-28 03:55:20,186 INFO L226 Difference]: Without dead ends: 495 [2022-04-28 03:55:20,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=587, Invalid=3195, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:55:20,186 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:20,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:55:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-28 03:55:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 295. [2022-04-28 03:55:24,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:24,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:24,333 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:24,340 INFO L93 Difference]: Finished difference Result 495 states and 620 transitions. [2022-04-28 03:55:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 620 transitions. [2022-04-28 03:55:24,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:24,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:24,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-28 03:55:24,341 INFO L87 Difference]: Start difference. First operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 495 states. [2022-04-28 03:55:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:24,349 INFO L93 Difference]: Finished difference Result 495 states and 620 transitions. [2022-04-28 03:55:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 620 transitions. [2022-04-28 03:55:24,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:24,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:24,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:24,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.3413793103448275) internal successors, (389), 290 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 393 transitions. [2022-04-28 03:55:24,354 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 393 transitions. Word has length 45 [2022-04-28 03:55:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:24,354 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 393 transitions. [2022-04-28 03:55:24,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 03:55:24,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 393 transitions. [2022-04-28 03:56:07,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 388 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2022-04-28 03:56:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:56:07,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:07,656 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:07,672 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 03:56:07,856 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,SelfDestructingSolverStorable50 [2022-04-28 03:56:07,856 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -865152440, now seen corresponding path program 19 times [2022-04-28 03:56:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660467047] [2022-04-28 03:56:08,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:56:08,041 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -450729306, now seen corresponding path program 1 times [2022-04-28 03:56:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:08,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722940428] [2022-04-28 03:56:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:08,055 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:56:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:08,091 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_48.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:56:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:08,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {75449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75430#true} is VALID [2022-04-28 03:56:08,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {75430#true} assume true; {75430#true} is VALID [2022-04-28 03:56:08,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75430#true} {75430#true} #94#return; {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {75430#true} call ULTIMATE.init(); {75449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {75449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {75430#true} assume true; {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75430#true} {75430#true} #94#return; {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {75430#true} call #t~ret17 := main(); {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {75430#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {75430#true} [192] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~x~0_827 v_main_~x~0_826)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (= v_main_~y~0_931 v_main_~y~0_930)) (.cse2 (mod v_main_~x~0_827 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (= v_main_~x~0_826 (+ v_main_~x~0_827 v_main_~y~0_931 (* (- 1) v_main_~y~0_930))) (forall ((v_it_48 Int)) (or (< 0 (mod (+ v_main_~x~0_827 (* 4294967295 v_it_48)) 4294967296)) (not (<= 1 v_it_48)) (not (<= (+ v_main_~y~0_931 v_it_48 1) v_main_~y~0_930)))) (< v_main_~y~0_931 v_main_~y~0_930) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_931, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_827, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_930, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_826, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {75430#true} [191] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {75430#true} is VALID [2022-04-28 03:56:08,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {75430#true} ~z~0 := ~y~0; {75430#true} is VALID [2022-04-28 03:56:08,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {75430#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {75436#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {75436#(<= main_~z~0 (+ (* (div main_~z~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; {75437#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {75437#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {75438#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {75438#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {75439#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {75439#(<= main_~z~0 (+ 4294967290 (* (div main_~z~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; {75440#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:56:08,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {75440#(<= main_~z~0 (+ (* (div main_~z~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; {75441#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {75441#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {75441#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {75441#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967289))} is VALID [2022-04-28 03:56:08,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {75442#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75443#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} is VALID [2022-04-28 03:56:08,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {75443#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75444#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {75444#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {75445#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} is VALID [2022-04-28 03:56:08,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {75445#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75446#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {75446#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75447#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {75447#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {75448#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {75431#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {75431#false} assume !(~y~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {75431#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {75431#false} ~cond := #in~cond; {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {75431#false} assume 0 == ~cond; {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {75431#false} assume !false; {75431#false} is VALID [2022-04-28 03:56:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 03:56:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:08,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722940428] [2022-04-28 03:56:08,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722940428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:08,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805338614] [2022-04-28 03:56:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:08,300 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 03:56:08,302 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 03:56:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:08,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:56:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:08,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:08,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {75430#true} call ULTIMATE.init(); {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {75430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {75430#true} assume true; {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75430#true} {75430#true} #94#return; {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {75430#true} call #t~ret17 := main(); {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {75430#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {75430#true} [192] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~x~0_827 v_main_~x~0_826)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (= v_main_~y~0_931 v_main_~y~0_930)) (.cse2 (mod v_main_~x~0_827 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (= v_main_~x~0_826 (+ v_main_~x~0_827 v_main_~y~0_931 (* (- 1) v_main_~y~0_930))) (forall ((v_it_48 Int)) (or (< 0 (mod (+ v_main_~x~0_827 (* 4294967295 v_it_48)) 4294967296)) (not (<= 1 v_it_48)) (not (<= (+ v_main_~y~0_931 v_it_48 1) v_main_~y~0_930)))) (< v_main_~y~0_931 v_main_~y~0_930) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_931, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_827, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_930, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_826, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {75430#true} [191] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {75430#true} is VALID [2022-04-28 03:56:08,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {75430#true} ~z~0 := ~y~0; {75430#true} is VALID [2022-04-28 03:56:08,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {75430#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {75483#(<= main_~z~0 (+ (* (div (+ main_~z~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; {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-28 03:56:08,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 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; {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:56:08,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~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; {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~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; {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:56:08,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-28 03:56:08,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {75431#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {75431#false} assume !(~y~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L272 TraceCheckUtils]: 36: Hoare triple {75431#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {75431#false} ~cond := #in~cond; {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {75431#false} assume 0 == ~cond; {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {75431#false} assume !false; {75431#false} is VALID [2022-04-28 03:56:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 03:56:08,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:08,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {75431#false} assume !false; {75431#false} is VALID [2022-04-28 03:56:08,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {75431#false} assume 0 == ~cond; {75431#false} is VALID [2022-04-28 03:56:08,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {75431#false} ~cond := #in~cond; {75431#false} is VALID [2022-04-28 03:56:08,887 INFO L272 TraceCheckUtils]: 36: Hoare triple {75431#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75431#false} is VALID [2022-04-28 03:56:08,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {75431#false} assume !(~y~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {75431#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {75431#false} is VALID [2022-04-28 03:56:08,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {75431#false} is VALID [2022-04-28 03:56:08,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75528#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:56:08,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-28 03:56:08,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~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; {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:56:08,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~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; {75503#(<= main_~z~0 (+ 4294967288 (* (div (+ main_~z~0 6) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 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; {75499#(<= main_~z~0 (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:56:08,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~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; {75495#(<= main_~z~0 (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 4294967290))} is VALID [2022-04-28 03:56:08,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~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; {75491#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {75483#(<= main_~z~0 (+ (* (div (+ main_~z~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; {75487#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {75483#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {75430#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75435#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {75430#true} ~z~0 := ~y~0; {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {75430#true} [191] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {75430#true} [192] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~x~0_827 v_main_~x~0_826)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (= v_main_~y~0_931 v_main_~y~0_930)) (.cse2 (mod v_main_~x~0_827 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (= v_main_~x~0_826 (+ v_main_~x~0_827 v_main_~y~0_931 (* (- 1) v_main_~y~0_930))) (forall ((v_it_48 Int)) (or (< 0 (mod (+ v_main_~x~0_827 (* 4294967295 v_it_48)) 4294967296)) (not (<= 1 v_it_48)) (not (<= (+ v_main_~y~0_931 v_it_48 1) v_main_~y~0_930)))) (< v_main_~y~0_931 v_main_~y~0_930) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_931, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_827, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_930, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_826, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {75430#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {75430#true} call #t~ret17 := main(); {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75430#true} {75430#true} #94#return; {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {75430#true} assume true; {75430#true} is VALID [2022-04-28 03:56:08,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {75430#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75430#true} is VALID [2022-04-28 03:56:08,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {75430#true} call ULTIMATE.init(); {75430#true} is VALID [2022-04-28 03:56:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 03:56:08,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805338614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:08,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:08,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-28 03:56:09,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:09,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660467047] [2022-04-28 03:56:09,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660467047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:09,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:09,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:56:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488861437] [2022-04-28 03:56:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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 45 [2022-04-28 03:56:09,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:09,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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 03:56:09,297 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 03:56:09,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:56:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:56:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:56:09,299 INFO L87 Difference]: Start difference. First operand 295 states and 393 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 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)